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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A093257 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 57. 0
0, 57, 22855, 775244, 8800855005, 770070110010, 9999966, 99999945, 999999963, 9999999972 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

LINKS

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(3) is 22855 because its length-3 substrings (228, 285, 855) are all distinct and divisible by 57 and there is no larger number with this property

CROSSREFS

Cf. A093211, A093212, ..., A093299.

Sequence in context: A127455 A091749 A094777 * A069255 A065869 A022082

Adjacent sequences:  A093254 A093255 A093256 * A093258 A093259 A093260

KEYWORD

base,nonn

AUTHOR

Hans Havermann (gladhobo(AT)teksavvy.com), Mar 29 2004

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 23:53 EST 2012. Contains 205689 sequences.