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”).
%I #14 Nov 20 2018 05:17:44
%S 4,24,264,14256,456192,26459136,635019264,153039642624,93507221643264,
%T 23470312632459264,20372231364974641152,155664219859771233042432,
%U 720258345291161495287332864,592052359829334749126187614208
%N a(1) = 4; a(n) is the smallest multiple of a(n-1) that contains all the digits of a(n-1) and is not a multiple of 10.
%o (PARI) A077700(n, a=4)={my(c(n, c=vector(10))=for(i=1, #n=digits(n), c[n[i]+1]++); c); for(i=2, n, my(cc=c(a)); for(k=2, oo, k%5 && vecmin(c(k*a)-cc)>=0 && (a*=k) && break)); a} \\ n=2 and optional 2nd arg as starting value yields next term:
%o print1(a=A077700(1)); for(n=2, 10, print1(", "a=A077700(2, a))) \\ _M. F. Hasler_, Nov 18 2018
%Y Cf. A077701 (the ratios a(n+1)/a(n)).
%Y Cf. A077696, A077698 (analog for initial term 2 resp. 3).
%K base,nonn
%O 1,1
%A _Amarnath Murthy_, Nov 18 2002
%E More terms from _Ray Chandler_, Jul 25 2003
%E Name edited by _M. F. Hasler_, Nov 18 2018