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”).

a(1) = 3, a(n) is the smallest multiple of a(n-1) that contains all the digits of a(n-1), or which can be obtained by inserting digits anywhere in a permutation of digits of a(n-1) (prefix, suffix or insertion). Zeros are not to be suffixed. a(n) is not divisible by 10.
2

%I #10 Nov 18 2018 20:41:29

%S 3,33,363,16335,310365,30726135,25349061375,7934256210375,

%T 2832529467103875,1022543137624498875,1322148276948477045375,

%U 2804276495407719813240375,8937229190864403044797075125

%N a(1) = 3, a(n) is the smallest multiple of a(n-1) that contains all the digits of a(n-1), or which can be obtained by inserting digits anywhere in a permutation of digits of a(n-1) (prefix, suffix or insertion). Zeros are not to be suffixed. a(n) is not divisible by 10.

%Y Cf. A077699.

%K base,nonn

%O 1,1

%A _Amarnath Murthy_, Nov 18 2002

%E More terms from _Ray Chandler_, Jul 25 2003