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
 9, 99, 9009, 909909, 100999899, 908999091, 9998990001, 89990910009, 989900010099, 90080900919009, 500939890010609049, 59986049009100401790603, 8100396086090900056999447914, 2999025843745606109903019600096048 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Seems to show some pattern. LINKS CROSSREFS Cf. A077711. Sequence in context: A265203 A078238 A080494 * A088780 A132544 A017018 Adjacent sequences: A077707 A077708 A077709 * A077711 A077712 A077713 KEYWORD base,nonn AUTHOR Amarnath Murthy, Nov 18 2002 EXTENSIONS Corrected and extended by Ray Chandler, Jul 27 2003 STATUS approved

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 March 28 08:25 EDT 2023. Contains 361585 sequences. (Running on oeis4.)