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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A093212 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 12. 87

%I

%S 0,72484,97204804,99720048004,99972000480004,99997200004800004,

%T 99999720000048000004,99999972000000480000004,

%U 99999997200000004800000004,99999999720000000048000000004

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

%C Observation: at least for the first nine positive terms a(n) is also the concatenation of n-2 9´s, 72, n-2 0's, 48, n-2 0's, and 4. - _Omar E. Pol_, May 21 2017

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

%e a(2) is 72484 because its length-2 substrings (72, 24, 48, 84) are all distinct and divisible by 12 and there is no larger number with this property

%Y Cf. A093211, A093213, ..., A093299.

%K base,nonn,more

%O 1,2

%A _Hans Havermann_, Mar 28 2004

%E a(8)-a(10) from _John Cerkan_, May 21 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 18 12:35 EST 2019. Contains 329261 sequences. (Running on oeis4.)