The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A077708 a(1) = 8, a(n)= 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). a(n)/a(n-1) is not equal to 10^k. 1

%I #5 Dec 05 2013 19:55:55

%S 8,48,384,13824,304128,81810432,31415205888,11340889325568,

%T 30246151831289856,15062583611982348288,118482282691853151633408,

%U 1014326822124954831133605888,10512483184503031869868691423232

%N a(1) = 8, a(n)= 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). a(n)/a(n-1) is not equal to 10^k.

%Y Cf. A077709.

%K base,nonn

%O 1,1

%A _Amarnath Murthy_, Nov 18 2002

%E More terms from _Ray Chandler_, Jul 27 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 3 19:07 EDT 2023. Contains 365870 sequences. (Running on oeis4.)