The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Based on an Erich Friedman observation of a(3). LINKS Hans Havermann, Table of A093211-A093299 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 Adjacent sequences:  A093216 A093217 A093218 * A093220 A093221 A093222 KEYWORD base,nonn AUTHOR Hans Havermann, Mar 27 2004 EXTENSIONS a(11) from John Cerkan, Jul 13 2017 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 12 23:20 EDT 2021. Contains 344979 sequences. (Running on oeis4.)