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

%I #16 Jan 09 2018 14:29:27

%S 0,964800,99288000,99840000,9998400000,999984000000,99999840000000,

%T 9999998400000000,999999984000000000,99999999840000000000,

%U 9999999998400000000000,999999999984000000000000,99999999999840000000000000,9999999999998400000000000000

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

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

%e a(2) is 964800 because its length-2 substrings (96, 64, 48, 80, 00) are all distinct and divisible by 16 and there is no larger number with this property.

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

%K base,nonn,less

%O 1,2

%A _Hans Havermann_, Mar 28 2004

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

%E a(11)-a(14) from _John Cerkan_, Jan 09 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 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)