1,1

We use N_b to denote "N read in base b". Similar to A121263, but now we write the numerals in the stack in binary:

......10....10.....10......10........etc.

..............11.....11......11..........

.......................100.....100.......

..................................101....

The next two terms have about 144 and 450 digits respectively.

A "dungeon" of numbers.

David Applegate, Marc LeBrun and N. J. A. Sloane, Descending Dungeons, Problem 11286, Amer. Math. Monthly, 116 (2009) 466-467.

David Applegate, Marc LeBrun and N. J. A. Sloane, Descending Dungeons and Iterated Base-Changing, in "The Mathematics of Preference, Choice and Order: Essays in Honor of Peter Fishburn", edited by Steven Brams, William V. Gehrlein and Fred S. Roberts, Springer, 2009, pp. 393-402.

David Applegate, Marc LeBrun and N. J. A. Sloane, Descending Dungeons and Iterated Base-Changing (arXiv:math.NT/0611293).

Cf. A121263, A121265.

Sequence in context: A024774 A068543 A064026 this_sequence A141566 A078736 A042669

Adjacent sequences: A121261 A121262 A121263 this_sequence A121265 A121266 A121267

nonn,base

Marc LeBrun (mlb(AT)well.com), Aug 23 2006