|
%I #8 Jul 06 2018 08:06:26
%S 0,0,0,0,0,0,0,0,0,0,45,134,309,652,1323,2634,5193,10184,19911,38854,
%T 133040,412527,1241773,3701864,10999194,32642353,96825335,287134794,
%U 851344708,2523819059,10866247001,43994094066,175538023511,697843906028
%N a(n) = A121295(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,11
%A _N. J. A. Sloane_, Sep 24 2007
|
