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