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

%I #17 Jan 05 2018 15:28:14

%S 0,86,8602,9976,99932,999922,1110002666000,3303303088088080,999999916,

%T 44444404406666660660,999999099006666660660044444404400,999999999936,

%U 77777770007008888888000800,5555555000500088888880008000,999999999999984,77777777770000702222222222000020

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

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

%e a(7) is 1110002666000 because its length-7 substrings (1110002, 1100026, 1000266, 0002666, 0026660, 0266600, 2666000) are all distinct and divisible by 86 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(13) from _John Cerkan_, Jul 05 2017

%E a(14)-a(16) from _John Cerkan_, Jan 04 2018