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

%I #8 Jan 08 2018 14:35:07

%S 0,68,3408,10204080,77792888,888080444040,55505008880800,

%T 9990900088808000,666663636888884848,222220022044444004408888800880,

%U 7777700770044444004400,999999999936,55555505555004444440444400,9999999999190044444444448400,666666666606660444444444404440

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

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

%e a(4) is 10204080 because its length-4 substrings (1020, 0204, 2040, 0408, 4080) are all distinct and divisible by 68 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(11)-a(15) from _John Cerkan_, Jan 08 2018