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!)
A122734 a(n) = A121265(n) - A121263(n). 2
0, 0, 0, 0, 0, 5, 17, 38, 86, 365, 1575, 11904, 249324, 14103554, 5358891212, 19563802362362, 3359230167951559162, 181335944930584275675837231, 54416647690014492928933662292768862601, 6605721238793689879501639879905020611382966457124102349, 360539645288616164606228883801608423987740093330992456820074646988075733781888309 (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

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

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: A072332 A212968 A127744 * A250413 A163686 A147165

Adjacent sequences: A122731 A122732 A122733 * A122735 A122736 A122737

KEYWORD

nonn

AUTHOR

David Applegate and N. J. A. Sloane, Sep 24 2006

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 March 26 23:26 EDT 2023. Contains 361553 sequences. (Running on oeis4.)