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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A093259 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 59. 0
0, 59, 944, 9971, 99946, 771071449049, 444022266603339990, 8888444422221111, 222222202555555505, 55555550507777777070 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

LINKS

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(6) is 771071449049 because its length-6 substrings (771071, 710714, 107144, 071449, 714490, 144904, 449049) are all distinct and divisible by 59 and there is no larger number with this property

CROSSREFS

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

Sequence in context: A125034 A140024 A142363 * A134652 A017775 A017722

Adjacent sequences:  A093256 A093257 A093258 * A093260 A093261 A093262

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 15 14:02 EST 2012. Contains 205811 sequences.