A131012 a(n) = A121295(n) - A121265(n).

0, 0, 0, 0, 0, -2, -3, -3, 1, -72, 3303, 10788, 287767, -2441508, 41165366097, 1073195273432754, 155912367904160034530, 3136560083478359027185613587, 539970867097445764756784886568605205005, -6513790584274345956893756600832505179138091590508595552

Offset

0,6

Comments

We conjecture that from some point on, 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=0..19.

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: A123948 A329430 A188886 * A083057 A099028 A357521

Adjacent sequences: A131009 A131010 A131011 * A131013 A131014 A131015

Keyword

sign

Author

N. J. A. Sloane, Sep 24 2007

Status

approved