Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093211
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093211 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 11. +0
88
0, 99, 99022099, 9988998, 99990222209999, 99998899998, 99999902222220999999 (list; graph; listen)
OFFSET

1,2

LINKS

Hans Havermann, Table of A093211-A093299

EXAMPLE

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

CROSSREFS

Cf. A093212, A093213, ..., A093299.

Sequence in context: A046173 A098609 A132607 this_sequence A010114 A015068 A069037

Adjacent sequences: A093208 A093209 A093210 this_sequence A093212 A093213 A093214

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