OFFSET
1,5
COMMENTS
Suggested by a remark in the Applegate et al. paper.
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
Alois P. Heinz, Table of n, a(n) for n = 1..10000
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 and N. J. A. Sloane, Descending Dungeons, Problem 11286, Amer. Math. Monthly, 116 (2009) 466-467.
EXAMPLE
1.1117820110418433222448626753505335401387930...
MAPLE
x:= LambertW(log(10/11))/log(10/11)/10:
s:= convert(evalf(x, 140), string):
seq(parse(s[n+1]), n=1..120); # Alois P. Heinz, Nov 08 2015
MATHEMATICA
RealDigits[-ProductLog[-Log[11/10]]/(10*Log[11/10]), 10, 105][[1]] (* Jean-François Alcover, Feb 18 2016 *)
CROSSREFS
KEYWORD
nonn,cons
AUTHOR
N. J. A. Sloane, Feb 10 2007
STATUS
approved