This site is supported by donations to The OEIS Foundation.

 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

%I

%S 0,99,99022099,9988998,99990222209999,99998899998,

%T 99999902222220999999,999999889999998,99999999022222222099999999,

%U 9999999988999999998,99999999990222222222209999999999

%N a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 11.

%H John Cerkan, <a href="/A093211/a093211.py.txt">Python2.7</a>

%H Hans Havermann, <a href="/A093211/a093211.txt">Table of A093211-A093299</a>

%e 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.

%Y Cf. A093212, A093213, ..., A093299.

%K base,nonn

%O 1,2

%A _Hans Havermann_, Mar 28 2004

%E a(8)-a(10) from _John Cerkan_, May 20 2017

%E a(11) from _John Cerkan_, Oct 25 2017

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.

Last modified October 17 16:51 EDT 2019. Contains 328120 sequences. (Running on oeis4.)