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

%I #11 Jul 17 2017 11:53:55

%S 0,964,5448000,88640000,9996800000,999968000000,99999680000000,

%T 9999996800000000,999999968000000000,99999999680000000000,

%U 9999999996800000000000

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

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

%e a(3) is 5448000 because its length-3 substrings (544, 448, 480, 800, 000) are all distinct and divisible by 32 and there is no larger number with this property.

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

%K base,nonn

%O 1,2

%A _Hans Havermann_, Mar 28 2004

%E a(8)-a(11) from _John Cerkan_, Jul 17 2017

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 05:39 EDT 2024. Contains 371235 sequences. (Running on oeis4.)