Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #13 Jan 09 2018 14:31:13
%S 0,900,99000,9885055505,9988500555005,9998850005550005,
%T 9999885000055500005,9999988500000555000005,9999998850000005550000005,
%U 9999999885000000055500000005,9999999988500000000555000000005,9999999998850000000005550000000005
%N a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 15.
%H Hans Havermann, <a href="/A093211/a093211.txt">Table of A093211-A093299</a>
%e a(3) is 99000 because its length-3 substrings (990, 900, 000) are all distinct and divisible by 15 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(8)-a(11) from _John Cerkan_, May 22 2017
%E a(12) from _John Cerkan_, Jan 09 2018