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 #8 Jan 08 2018 15:08:12
%S 0,69,966,9936,44436777,888444222111,2222007555500,3333300366666006,
%T 555550050888880080,99999009006666600600,99999999978,
%U 666666666060999999999090,88888808008085555550500505,6666666660600033333333303000,555555550055550222222220022220
%N a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 69.
%H Hans Havermann, <a href="/A093211/a093211.txt">Table of A093211-A093299</a>
%e a(5) is 44436777 because its length-5 substrings (44436, 44367, 43677, 36777) are all distinct and divisible by 69 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