|
|
A266999
|
|
Smallest number m such that A266998(m) = n.
|
|
3
|
|
|
1, 10, 4, 12, 6, 3, 2, 11, 5, 18, 7, 13, 9, 19, 8, 17, 115, 3789
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
The next term is too large to include.
|
|
LINKS
|
|
|
FORMULA
|
|
|
MATHEMATICA
|
a266999={};
f[n_]:=Total[IntegerDigits[n]*(IntegerDigits[n]+1)/2];
g[n_]:=NestWhileList[f[#]&, n, #>1&];
h[n_]:=Length[g[n]]-1;
a266998=h/@Range[10^6];
Do[AppendTo[a266999, First[Position[a266998, m]]], {m, 0, Max[a266998]}];
a266999//Flatten
|
|
PROG
|
(PARI) strd(n) = {my(d = digits(n)); sum(k=1, #d, d[k]*(d[k]+1)/2); }
nbi(n) = {my(nb=0); while(n != 1, n = strd(n); nb++; ); nb; }
a(n) = {my(m = 1); while(nbi(m) != n, m++); m; } \\ Michel Marcus, Jan 12 2016
|
|
CROSSREFS
|
|
|
KEYWORD
|
base,more,nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|