A131011 a(n) = A121295(n) - A121263(n).

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 45, 134, 309, 652, 1323, 2634, 5193, 10184, 19911, 38854, 133040, 412527, 1241773, 3701864, 10999194, 32642353, 96825335, 287134794, 851344708, 2523819059, 10866247001, 43994094066, 175538023511, 697843906028

Offset: 10

Author

N. J. A. Sloane, Sep 24 2007

Keywords

• nonn

Comments

We conjecture that all terms are >= 0.

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.