login
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 48.
0

%I #8 Jan 08 2018 18:27:54

%S 0,96,6720,99360000,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 48.

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

%e a(4) is 99360000 because its length-4 substrings (9936, 9360, 3600, 6000, 0000) are all distinct and divisible by 48 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(14) from _John Cerkan_, Jan 08 2018