A111050 Same as A121863 but start at 8 instead of 16.

8, 14, 44, 268, 72368, 10474616694, 548587974441592064876, 165096873787118432788111503546470822864506422983866575256543132

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: A250478 A059676 A242198 * A009453 A332658 A198307

Adjacent sequences: A111047 A111048 A111049 * A111051 A111052 A111053

Keyword

nonn,base

Author

N. J. A. Sloane, Sep 05 2006

Status

approved