Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093221
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093221 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 21. +0
1
0, 8421, 75672, 760273087, 7677679779737737, 99997899997, 777300377790097776006777, 7777778477777721777777, 77777752577777725277777752, 7777770021777777008477777700 (list; graph; listen)
OFFSET

1,2

LINKS

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(2) is 8421 because its length-2 substrings (84, 42, 21) are all distinct and divisible by 21, and there is no larger number with this property

CROSSREFS

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

Sequence in context: A049357 A069402 A139005 this_sequence A023321 A116258 A116311

Adjacent sequences: A093218 A093219 A093220 this_sequence A093222 A093223 A093224

KEYWORD

base,nonn

AUTHOR

Hans Havermann (pxp(AT)rogers.com), Mar 28 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 July 23 17:35 EDT 2008. Contains 142285 sequences.


AT&T Labs Research