Journal of Integer Sequences, Vol. 10 (2007), Article 07.1.2 |

Korteweg-de Vries Institute for Mathematics

University of Amsterdam

Plantage Muidergracht 24

1018 TV Amsterdam

Netherlands

John P. Linderman, N. J. A. Sloane and Allan R. Wilks

AT&T Shannon Labs

180 Park Avenue

Florham Park, NJ 07932-0971

USA

**Abstract:**

The sequence starts with ; to extend it one writes the sequence
so far as , where and are strings of integers, is
nonempty and is as large as possible: then the next term is .
The sequence begins 1, 1, 2, 1, 1, 2, 2, 2, 3, 1, 1, 2, 1, 1, 2, 2, 2, 3,
2, A appears for the first time at position 220, but a
does not appear until about position .
The main result of the paper is a proof that the sequence is unbounded.
We also present results from extensive numerical investigations
of the sequence and of certain derived sequences, culminating
with a heuristic argument that
(for ) appears for the first time at about position
,
where denotes exponentiation.
The final section discusses generalizations.

(Concerned with sequences A000002 A001511 A010060 A090822 A091408 A091409 A091410 A091411 A091412 A091413 A091579 A091586 A091587 A091588 A001906 A091799 A091839 A091970 A091975 A091976 A092331 A092332 A092333 A092334 A092335 A093914 A093921 A093955 A093956 A093957 A091588 A094006 A094321 A094781 .)

Received February 22 2006;
revised version received September 13 2006.
Published in *Journal of Integer Sequences* December 16 2006.

Return to