login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A077698 a(1) = 3, 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).zeros are not to be suffixed. a(n) is not divisible by 10. 1
3, 33, 363, 16335, 310365, 30726135, 25349061375, 7934256210375, 2832529467103875, 1022543137624498875, 1322148276948477045375, 2804276495407719813240375, 8937229190864403044797075125 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

CROSSREFS

Cf. A077699.

Sequence in context: A002277 A001507 A075835 * A080488 A082778 A163476

Adjacent sequences:  A077695 A077696 A077697 * A077699 A077700 A077701

KEYWORD

base,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Nov 18 2002

EXTENSIONS

More terms from Ray Chandler (rayjchandler(AT)sbcglobal.net), Jul 25 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 04:48 EST 2012. Contains 205570 sequences.