cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A130287 a(n) = A121296(n) - A121263(n).

This page as a plain text file.
%I A130287 #9 Jul 06 2018 08:06:34
%S A130287 0,0,0,0,0,3,14,35,87,293,4878,22692,537091,11662046,46524257309,
%T A130287 1092759075795116,159271598072111593692,3317896028408943302861450818,
%U A130287 594387514787460257685718548861374067606,91930654519343922607883279072515432244874866615506797
%N A130287 a(n) = A121296(n) - A121263(n).
%C A130287 We conjecture that all terms are >= 0.
%D A130287 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 A130287 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 A130287 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 A130287 nonn
%O A130287 10,6
%A A130287 _David Applegate_ and _N. J. A. Sloane_, Sep 21 2007