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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A093289 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 89. 0
0, 89, 979, 338277, 99947, 999915, 2000008900000, 88080808440404042202020211010101, 110101010550505050, 99090909005505050500 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

LINKS

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(4) is 338277 because its length-4 substrings (3382, 3827, 8277) are all distinct and divisible by 89 and there is no larger number with this property

CROSSREFS

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

Sequence in context: A097155 A197348 A158716 * A103545 A118368 A197399

Adjacent sequences:  A093286 A093287 A093288 * A093290 A093291 A093292

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 17 04:58 EST 2012. Contains 205985 sequences.