|
%I #9 Jul 06 2018 04:46:43
%S 2,3,5,26,1370,9840770,851566070376026
%N See Comments for definition.
%C 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:
%C ......10....10.....10......10........etc.
%C ..............11.....11......11..........
%C .......................100.....100.......
%C ..................................101....
%C The next two terms have about 144 and 450 digits respectively.
%C A "dungeon" of numbers.
%D 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.
%H David Applegate, Marc LeBrun and N. J. A. Sloane, <a href="https://arxiv.org/abs/math/0611293">Descending Dungeons and Iterated Base-Changing</a>, arXiv:math/0611293 [math.NT], 2006-2007.
%H David Applegate, Marc LeBrun, N. J. A. Sloane, <a href="https://www.jstor.org/stable/40391135">Descending Dungeons, Problem 11286</a>, Amer. Math. Monthly, 116 (2009) 466-467.
%Y Cf. A121263, A121265.
%K nonn,base
%O 1,1
%A _Marc LeBrun_, Aug 23 2006
| 