OFFSET
1,1
COMMENTS
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.
REFERENCES
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.
LINKS
David Applegate, Marc LeBrun and N. J. A. Sloane, Descending Dungeons and Iterated Base-Changing, arXiv:math/0611293 [math.NT], 2006-2007.
David Applegate, Marc LeBrun, N. J. A. Sloane, Descending Dungeons, Problem 11286, Amer. Math. Monthly, 116 (2009) 466-467.
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Marc LeBrun, Aug 23 2006
STATUS
approved