Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A077698
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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. +0
2
3, 33, 363, 16335, 310365, 30726135, 25349061375, 7934256210375, 2832529467103875, 1022543137624498875, 1322148276948477045375, 2804276495407719813240375, 8937229190864403044797075125 (list; graph; listen)
OFFSET

1,1

CROSSREFS

Cf. A077699.

Sequence in context: A002277 A001507 A075835 this_sequence A080488 A082778 A163476

Adjacent sequences: A077695 A077696 A077697 this_sequence 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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 20 16:54 EST 2009. Contains 171081 sequences.


AT&T Labs Research