A130287 a(n) = A121296(n) - A121263(n).

0, 0, 0, 0, 0, 3, 14, 35, 87, 293, 4878, 22692, 537091, 11662046, 46524257309, 1092759075795116, 159271598072111593692, 3317896028408943302861450818, 594387514787460257685718548861374067606, 91930654519343922607883279072515432244874866615506797

Offset

10,6

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

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

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: A110427 A296294 A128916 * A167858 A179132 A068044

Adjacent sequences: A130284 A130285 A130286 * A130288 A130289 A130290

Keyword

nonn

Author

David Applegate and N. J. A. Sloane, Sep 21 2007

Status

approved