login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A128916 a(n) = A121296(n) - A121295(n). 1
0, 0, 0, 0, 0, 3, 14, 35, 87, 293, 4833, 22558, 536782, 11661394, 46524255986, 1092759075792482, 159271598072111588499, 3317896028408943302861440634, 594387514787460257685718548861374047695, 91930654519343922607883279072515432244874866615467943 (list; graph; refs; listen; history; text; internal format)
OFFSET
10,6
COMMENTS
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.
CROSSREFS
Sequence in context: A050934 A110427 A296294 * A130287 A167858 A179132
KEYWORD
nonn
AUTHOR
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 5 14:21 EDT 2024. Contains 374026 sequences. (Running on oeis4.)