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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A093255 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 55. 0
0, 55, 660550, 5500550, 6666055550, 55550055550, 66666605555550, 555555005555550, 666666660555555550, 5555555500555555550, 6666666666055555555550, 55555555550055555555550, 66666666666605555555555550, 555555555555005555555555550, 666666666666660555555555555550 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
Hans Havermann, Table of A093211-A093299
EXAMPLE
a(3) is 660550 because its length-3 substrings (660, 605, 055, 550) are all distinct and divisible by 55 and there is no larger number with this property.
CROSSREFS
Cf. A093211, A093212, ..., A093299.
Sequence in context: A172808 A243315 A172856 * A172896 A201823 A115410
KEYWORD
base,nonn
AUTHOR
Hans Havermann, Mar 29 2004
EXTENSIONS
a(9)-a(15) from John Cerkan, Jan 08 2018
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 20:33 EDT 2024. Contains 371916 sequences. (Running on oeis4.)