Match Problem

Given matches, find the number of topologically distinct planar arrangements which can be made.The first few values are 1, 1, 3, 5, 10, 19, 39, ... (Sloane's A003055).

References

Gardner, M. ``The Problem of the Six Matches.'' In The Unexpected Hanging and Other Mathematical Diversions. Chicago, IL: Chicago University Press, pp. 79-81, 1991.

Sloane, N. J. A. SequenceA003055/M2464in ``An On-Line Version of the Encyclopedia of Integer Sequences.''http://www.research.att.com/~njas/sequences/eisonline.html and Sloane, N. J. A. and Plouffe, S.The Encyclopedia of Integer Sequences. San Diego: Academic Press, 1995.

• Riffle Shuffle
• Rigby Points
• Right Angle
• Right Conoid
• Right Hyperbola
• Right Line
• Right Strophoid
• Right Strophoid Inverse Curve
• Right Triangle
• Rigid
• Rigidity Theorem
• Rigid Motion
• Ring
• Ring Cyclide
• Ring Function
• Ringoid
• Ring Torus
• Risch Algorithm
• Rising Factorial
• Rivest-Shamir-Adleman Number
• RMS
• r(n)
• Robbin Constant
• Robbins Algebra
• Robbins Equation