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!)
A093264 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 64. 0

%I #5 Mar 30 2012 18:39:53

%S 0,64,8960,84480000,8844800000,999936000000,99999360000000,

%T 9999993600000000

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

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

%e a(4) is 84480000 because its length-4 substrings (8448, 4480, 4800, 8000, 0000) are all distinct and divisible by 64 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

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 March 28 16:12 EDT 2024. Contains 371254 sequences. (Running on oeis4.)