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

%I #19 Jan 05 2018 14:42:42

%S 0,85,4255,9945,99960,999940,11101005550500,99999950,

%T 888800800555500500,9999999930,99999999980,333333033330555555055550,

%U 22222222020205555555505050,7777777707070055555555050500,999999999999920,5555555555500050555555555550005,9999999999999999055555555555555550

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

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

%e a(7) is 11101005550500 because its length-7 substrings (1110100, 1101005, 1010055, 0100555, 1005550, 0055505, 0555050, 5550500) are all distinct and divisible by 85 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(17) from _John Cerkan_, Jan 04 2018