A121866 Same as A121864 but start at 8 instead of 16.

8, 14, 40, 262, 352264, 1484585652808, 86279953484628827950028778425712, 7605980144769110332172415576695326607722497051737088217125532622141954502574772559281862172625424410193559821272357826

Offset

3,1

Comments

The convention used here is that e.g. 9_8 = 9.

The next term is too large to include.

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

Table of n, a(n) for n=3..10.

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

Sequence in context: A220037 A144840 A257709 * A301961 A250478 A059676

Adjacent sequences: A121863 A121864 A121865 * A121867 A121868 A121869

Keyword

nonn,base

Author

N. J. A. Sloane, Sep 05 2006

Status

approved