cp's OEIS Frontend

A063112 a(1) = 1; a(n+1) = a(n) + product of nonzero digits of a(n) when written in base 3. Display sequence in base 3.

%I A063112 #18 Jun 26 2018 04:59:12
%S A063112 1,2,11,12,21,100,101,102,111,112,121,200,202,220,1001,1002,1011,1012,
%T A063112 1021,1100,1101,1102,1111,1112,1121,1200,1202,1220,2001,2010,2012,
%U A063112 2100,2102,2120,2201,2212,10011,10012,10021,10100,10101,10102,10111,10112
%N A063112 a(1) = 1; a(n+1) = a(n) + product of nonzero digits of a(n) when written in base 3. Display sequence in base 3.
%H A063112 Harry J. Smith, <a href="/A063112/b063112.txt">Table of n, a(n) for n = 1..1000</a>
%H A063112 P. A. Loomis, <a href="http://facstaff.bloomu.edu/ploomis/sequences.html">An Interesting Family of Iterated Sequences</a>
%H A063112 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 A063112 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 A063112 <a href="/index/Coi#Colombian">Index entries for Colombian or self numbers and related sequences</a>
%o A063112 (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) }
%o A063112 ProdNzD(x)= { local(d, p); p=1; while (x>9, d=x-10*(x\10); if (d, p*=d); x\=10); return(p*x) }
%o A063112 { for (n=1, 1000, if (n>1, a=baseE(b+= ProdNzD(a), 3), a=1; b=1); write("b063112.txt", n, " ", a) ) } \\ _Harry J. Smith_, Aug 19 2009
%Y A063112 Cf. A063108, A063113, A063114.
%K A063112 nonn,base
%O A063112 1,2
%A A063112 _N. J. A. Sloane_, Aug 08 2001
%E A063112 More terms from _Vladeta Jovovic_, Aug 10 2001