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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

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, 999999889999998, 99999999022222222099999999, 9999999988999999998, 99999999990222222222209999999999 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..11.

John Cerkan, Python2.7

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: A233110 A233214 A228537 * A010114 A287284 A015068

Adjacent sequences:  A093208 A093209 A093210 * A093212 A093213 A093214

KEYWORD

base,nonn

AUTHOR

Hans Havermann, Mar 28 2004

EXTENSIONS

a(8)-a(10) from John Cerkan, May 20 2017

a(11) from John Cerkan, Oct 25 2017

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 13 06:26 EST 2019. Contains 329968 sequences. (Running on oeis4.)