Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A088760
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A088760 a(1) = 1, 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
1, 11, 121, 11132, 1013012, 1091013924, 1032099172104, 1907319270048192, 2731281194709010944, 11009794495872023115264, 22371902415611950970216448, 105573007499272796628451418112, 781029109479620149457283591192576 (list; graph; listen)
OFFSET

0,2

CROSSREFS

Cf. A077696-A077711, A088761.

Adjacent sequences: A088757 A088758 A088759 this_sequence A088761 A088762 A088763

Sequence in context: A003590 A072051 A092846 this_sequence A080486 A082776 A110398

KEYWORD

base,nonn

AUTHOR

Ray Chandler (rayjchandler(AT)sbcglobal.net), Oct 27 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 October 15 20:12 EDT 2008. Contains 145099 sequences.


AT&T Labs Research