login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A131011 A121295(n) - A121263(n). 1
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

10,11

COMMENTS

We conjecture that all terms are >= 0.

REFERENCES

David Applegate, Marc LeBrun and N. J. A. Sloane, Descending Dungeons, Problem 11286, Amer. Math. Monthly, 116 (2009) 466-467.

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..43.

David Applegate, Marc LeBrun and N. J. A. Sloane, Descending Dungeons and Iterated Base-Changing (arXiv:math.NT/0611293).

CROSSREFS

Sequence in context: A206209 A098924 A195318 * A156370 A044377 A044758

Adjacent sequences:  A131008 A131009 A131010 * A131012 A131013 A131014

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Sep 24 2007

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified November 23 09:38 EST 2017. Contains 295115 sequences.