Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093222
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093222 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 22. +0
1
0, 88, 990220, 8866886, 9999022220, 88886688886, 99999902222220, 888888668888886 (list; graph; listen)
OFFSET

1,2

LINKS

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(3) is 990220 because its length-3 substrings (990, 902, 022, 220) are all distinct and divisible by 22, and there is no larger number with this property

CROSSREFS

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

Sequence in context: A048919 A093244 A079036 this_sequence A114922 A036951 A051328

Adjacent sequences: A093219 A093220 A093221 this_sequence A093223 A093224 A093225

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 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research