login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A232486
a(1) = 3; thereafter a(n+1) = a(n) + product of nonzero digits of a(n).
4
3, 6, 12, 14, 18, 26, 38, 62, 74, 102, 104, 108, 116, 122, 126, 138, 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
OFFSET
1,1
LINKS
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]
MAPLE
f:=proc(n) local t1, t2, i;
t1:=convert(n, base, 10);
t2:=1;
for i from 1 to nops(t1) do if t1[i] <> 0 then t2:=t2*t1[i]; fi; od;
t2; end;
g:=n->n+f(n);
t1:=[3];
for n from 1 to 50 do t1:=[op(t1), g(t1[nops(t1)])]; od:
t1;
CROSSREFS
KEYWORD
nonn,base
AUTHOR
N. J. A. Sloane, Nov 29 2013
STATUS
approved