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

%I #9 Jul 31 2017 05:58:13

%S 0,284,336448,977280084004,73500084000,888748888048888,

%T 7777756000008400000,7777977200004004000080080000,

%U 777777336000000448000000,777777977200000080080000004004000000,77777773500000000084000000000,888888888748888888888048888888888

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

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

%e a(3) is 336448 because its length-3 substrings (336, 364, 644, 448) are all distinct and divisible by 28 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(11)-a(12) from _John Cerkan_, Jul 30 2017