login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

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

%I #13 Jan 03 2018 19:43:32

%S 0,96,5768,662400,9993600000,999936000000,99999360000000,

%T 9999993600000000,999999936000000000,99999999360000000000,

%U 9999999993600000000000,999999999936000000000000,99999999999360000000000000,9999999999993600000000000000

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

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

%e a(4) is 662400 because its length-4 substrings (6624, 6240, 2400) are all distinct and divisible by 96 and there is no larger number with this property

%Y Cf. A093211, A093212, ..., A093299.

%K base,nonn

%O 1,2

%A _Hans Havermann_, Mar 29 2004

%E a(9)-a(13) from _John Cerkan_, Jun 19 2017

%E a(14) _John Cerkan_, Jan 03 2018

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 10:13 EDT 2024. Contains 371905 sequences. (Running on oeis4.)