login
a(n) = A121265(n) - A121295(n).
2

%I #10 Jul 06 2018 08:07:10

%S 0,0,0,0,0,5,17,38,86,365,1530,11770,249015,14102902,5358889889,

%T 19563802359728,3359230167951553969,181335944930584275675827047,

%U 54416647690014492928933662292768842690,6605721238793689879501639879905020611382966457124063495,360539645288616164606228883801608423987740093330992456820074646988075733781755269

%N a(n) = A121265(n) - A121295(n).

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