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.
- Kummer's Function
- Kummer's Quadratic Transformation
- Kummer's Relation
- Kummer's Series
- Kummer's Series Transformation
- Kummer's Test
- Kummer's Theorem
- Kummer Surface
- Kuratowski Reduction Theorem
- Kuratowski's Closure-Component Problem
- Kuratowski's Theorem
- Kurtosis
- Kähler Manifold
- König-Egeváry Theorem
- Königsberg Bridge Problem
- König's Theorem
- Kürschák's Tile
- L1-Norm
- L2-Norm
- L2-Space
- Labeled Graph
- Lacunarity
- Ladder
- Ladder Graph
- Lagrange Bracket