OFFSET
1,1
COMMENTS
Resembles A091787, but constructed by a greedy algorithm.
LINKS
F. J. van de Bult, D. C. Gijswijt, J. P. Linderman, N. J. A. Sloane and Allan Wilks, A Slow-Growing Sequence Defined by an Unusual Recurrence, J. Integer Sequences, Vol. 10 (2007), #07.1.2.
EXAMPLE
For n=2: we have a(1) = 1, so k=1; taking a(2) = 2 makes the next k=2.
For n=3, we have a(1),a(2) = 22, so k = 2 = a(3).
For n=4, we have a(1),...,a(3) = 222, so k = 3 = a(4).
For n=5, we have a(1),...,a(4) = 2223, so k = 1; taking a(5) = 3 makes the next k=2.
For n=6, we have a(1),...,a(5) = 22233, so k = 2 = a(6); etc.
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, Jun 03 2004
EXTENSIONS
More terms from John P. Linderman, Jun 03 2004
STATUS
approved