OFFSET
1,2
LINKS
Harry J. Smith, Table of n, a(n) for n = 1..1000
P. A. Loomis, An Interesting Family of Iterated Sequences
P. A. Loomis, An Introduction to Digit Product Sequences, J. Rec. Math., 32 (2003-2004), 147-151.
P. A. Loomis, An Introduction to Digit Product Sequences, J. Rec. Math., 32 (2003-2004), 147-151. [Annotated archived copy]
MATHEMATICA
f[n_Integer] := (a = Sort[ IntegerDigits[n, 3]]; While[ a[[1]] == 0, a = Delete[a, 1]]; n + Apply[ Times, a] ); NestList[f, 1, 65]
PROG
(PARI) baseE(x, b)= { local(d, e, f); e=0; f=1; while (x>0, d=x-b*(x\b); x\=b; e+=d*f; f*=10); return(e) }
ProdNzD(x)= { local(d, p); p=1; while (x>9, d=x-10*(x\10); if (d, p*=d); x\=10); return(p*x) }
{ for (n=1, 1000, if (n>1, a=baseE(b+= ProdNzD(a), 3), a=1; b=1); write("b063113.txt", n, " ", b) ) } \\ Harry J. Smith, Aug 19 2009
CROSSREFS
KEYWORD
nonn,base
AUTHOR
N. J. A. Sloane, Aug 08 2001
EXTENSIONS
More terms from Robert G. Wilson v, Aug 09 2001
STATUS
approved