login

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”).

A093219
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 19.
0
0, 19576, 722855133, 77714446555, 1100133003990098800855005, 99960944490466640699960, 444440433333037777707, 6666606077777070555550509999909011111010, 999999982, 11111101019999990909555555050577777707076666660606, 777777707773333333033344444440444
OFFSET
1,2
COMMENTS
Based on an Erich Friedman observation of a(3).
EXAMPLE
a(2) is 19576 because its length-2 substrings (19, 95, 57, 76) are all distinct and divisible by 19 and there is no larger number with this property.
CROSSREFS
Cf. A093211, A093212, ..., A093299.
Sequence in context: A033869 A031801 A022213 * A184493 A339534 A319062
KEYWORD
base,nonn
AUTHOR
Hans Havermann, Mar 27 2004
EXTENSIONS
a(11) from John Cerkan, Jul 13 2017
STATUS
approved