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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A093211 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 11. 88
0, 99, 99022099, 9988998, 99990222209999, 99998899998, 99999902222220999999 (list; graph; refs; listen; history; internal format)
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: A195623 A190921 A132607 * A010114 A015068 A154230

Adjacent sequences:  A093208 A093209 A093210 * A093212 A093213 A093214

KEYWORD

base,nonn

AUTHOR

Hans Havermann (gladhobo(AT)teksavvy.com), Mar 28 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 02:48 EST 2012. Contains 205978 sequences.