Mian-Chowla Sequence

The sequence produced by starting with and applying the Greedy Algorithm in the following way: for each, let be the least Integer exceeding for which are all distinct, with .This procedure generates the sequence 1, 2, 4, 8, 13, 21, 31, 45, 66, 81, 97, 123, 148, 182, 204, 252, 290, ...(Sloane's A005282). The Reciprocal sum of the sequence,

References

Guy, R. K. ``-Sequences.'' §E28 in Unsolved Problems in Number Theory, 2nd ed. New York: Springer-Verlag, pp. 228-229, 1994.

Sloane, N. J. A. SequenceA005282/M1094in ``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.

• Klarner-Rado Sequence
• Klarner's Theorem
• Klein-Beltrami Model
• Klein Bottle
• Klein Four-Group
• Klein-Gordon Equation
• Kleinian Group
• Klein Quartic
• Klein's Absolute Invariant
• Klein's Equation
• Klein's Theorem
• Kloosterman's Sum
• k-Matrix
• Knapsack Problem
• Kneser-Sommerfeld Formula
• Knights of the Round Table
• Knights Problem
• Knight's Tour
• Knot
• Knot Complement
• Knot Curve
• Knot Determinant
• Knot Diagram
• Knot Exterior
• Knot Linking