[go: up one dir, main page]

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!)
A130287 a(n) = A121296(n) - A121263(n). 1

%I #9 Jul 06 2018 08:06:34

%S 0,0,0,0,0,3,14,35,87,293,4878,22692,537091,11662046,46524257309,

%T 1092759075795116,159271598072111593692,3317896028408943302861450818,

%U 594387514787460257685718548861374067606,91930654519343922607883279072515432244874866615506797

%N a(n) = A121296(n) - A121263(n).

%C We conjecture that all terms are >= 0.

%D 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.

%H David Applegate, Marc LeBrun and N. J. A. Sloane, <a href="https://arxiv.org/abs/math/0611293">Descending Dungeons and Iterated Base-Changing</a>, arXiv:math/0611293 [math.NT], 2006-2007.

%H David Applegate, Marc LeBrun, N. J. A. Sloane, <a href="https://www.jstor.org/stable/40391135">Descending Dungeons, Problem 11286</a>, Amer. Math. Monthly, 116 (2009) 466-467.

%K nonn

%O 10,6

%A _David Applegate_ and _N. J. A. Sloane_, Sep 21 2007

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 August 29 09:09 EDT 2024. Contains 375511 sequences. (Running on oeis4.)