Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093289
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093289 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 89. +0
1
0, 89, 979, 338277, 99947, 999915, 2000008900000, 88080808440404042202020211010101, 110101010550505050, 99090909005505050500 (list; graph; listen)
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: A103548 A097155 A158716 this_sequence A103545 A118368 A105719

Adjacent sequences: A093286 A093287 A093288 this_sequence A093290 A093291 A093292

KEYWORD

base,nonn

AUTHOR

Hans Havermann (pxp(AT)rogers.com), Mar 29 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 08:46 EST 2009. Contains 167481 sequences.


AT&T Labs Research