|
%I #5 Mar 30 2012 18:39:52
%S 0,500,95000,9950000,999500000,99995000000,9999950000000,
%T 999999500000000
%N a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 50.
%H Hans Havermann, <a href="/A093211/a093211.txt">Table of A093211-A093299</a>
%e a(3) is 95000 because its length-3 substrings (950, 500, 000) are all distinct and divisible by 50 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
|
