This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A232486 #11 Nov 29 2013 21:00:47 %S A232486 3,6,12,14,18,26,38,62,74,102,104,108,116,122,126,138,162,174,202,206, %T A232486 218,234,258,338,410,414,430,442,474,586,826,922,958,1318,1342,1366, %U A232486 1474,1586,1826,1922,1958,2318,2366,2582,2742,2854,3174,3258,3498,4362,4506 %N A232486 a(1) = 3; thereafter a(n+1) = a(n) + product of nonzero digits of a(n). %H A232486 P. A. Loomis, <a href="http://facstaff.bloomu.edu/ploomis/itseq4.ps">An Introduction to Digit Product Sequences</a>, J. Rec. Math., 32 (2003-2004), 147-151. %H A232486 P. A. Loomis, <a href="/A063108/a063108.pdf">An Introduction to Digit Product Sequences</a>, J. Rec. Math., 32 (2003-2004), 147-151. [Annotated archived copy] %H A232486 <a href="/index/Coi#Colombian">Index entries for Colombian or self numbers and related sequences</a> %p A232486 f:=proc(n) local t1,t2,i; %p A232486 t1:=convert(n,base,10); %p A232486 t2:=1; %p A232486 for i from 1 to nops(t1) do if t1[i] <> 0 then t2:=t2*t1[i]; fi; od; %p A232486 t2; end; %p A232486 g:=n->n+f(n); %p A232486 t1:=[3]; %p A232486 for n from 1 to 50 do t1:=[op(t1),g(t1[nops(t1)])]; od: %p A232486 t1; %Y A232486 Cf. A063018, A232485, A232487, A232488. %K A232486 nonn,base %O A232486 1,1 %A A232486 _N. J. A. Sloane_, Nov 29 2013