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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A093258 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 58. 0
0, 58, 986, 556844, 881026680, 30803880208220, 9990906888080, 99999946, 999999982, 11110100106666060060 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

LINKS

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(4) is 556844 because its length-4 substrings (5568, 5684, 6844) are all distinct and divisible by 58 and there is no larger number with this property

CROSSREFS

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

Sequence in context: A172215 A157252 A142966 * A184599 A160347 A181280

Adjacent sequences:  A093255 A093256 A093257 * A093259 A093260 A093261

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 09:18 EST 2012. Contains 205614 sequences.