login
A095992
a(1) = 30; for n > 1, a(n+1) = a(n) + {product of nonzero digits of a(n)}.
0
30, 33, 42, 50, 55, 80, 88, 152, 162, 174, 202, 206, 218, 234, 258, 338, 410, 414, 430, 442, 474, 586, 826, 922, 958, 1318, 1342, 1366, 1474, 1586, 1826, 1922, 1958, 2318, 2366, 2582, 2742, 2854, 3174, 3258, 3498, 4362, 4506, 4626, 4914, 5058, 5258, 5658
OFFSET
1,1
REFERENCES
From a puzzle; explanation found by Pierre Roger.
MATHEMATICA
a[1] = 30; a[n_] := a[n] = Block[{s = Sort[ IntegerDigits[a[n - 1]]]}, While[ s[[1]] == 0, s = Drop[s, 1]]; a[n - 1] + Times @@ s]; Table[ a[n], {n, 50}]
nxt[n_] := n+Times@@Select[IntegerDigits[n], #>0&]; NestList[nxt, 30, 50] (* Harvey P. Dale, Jan 08 2011 *)
KEYWORD
nonn,base,easy
AUTHOR
Julien Piquet (julipiquet(AT)yahoo.fr), Jul 18 2004
EXTENSIONS
The proposer suggests that this web site may contain other sequences also.
Edited and extended by Robert G. Wilson v and Klaus Brockhaus, Jul 20 2004
STATUS
approved