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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A077710 a(1) = 9, 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. 2

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

%S 9,99,9009,909909,100999899,908999091,9998990001,89990910009,

%T 989900010099,90080900919009,500939890010609049,

%U 59986049009100401790603,8100396086090900056999447914,2999025843745606109903019600096048

%N a(1) = 9, 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.

%C Seems to show some pattern.

%Y Cf. A077711.

%K base,nonn

%O 1,1

%A _Amarnath Murthy_, Nov 18 2002

%E Corrected and extended by _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 June 7 22:39 EDT 2023. Contains 363157 sequences. (Running on oeis4.)