login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
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

%I #11 Jul 14 2017 11:25:59

%S 0,19576,722855133,77714446555,1100133003990098800855005,

%T 99960944490466640699960,444440433333037777707,

%U 6666606077777070555550509999909011111010,999999982,11111101019999990909555555050577777707076666660606,777777707773333333033344444440444

%N a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 19.

%C Based on an Erich Friedman observation of a(3).

%H Hans Havermann, <a href="/A093211/a093211.txt">Table of A093211-A093299</a>

%e 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.

%Y Cf. A093211, A093212, ..., A093299.

%K base,nonn

%O 1,2

%A _Hans Havermann_, Mar 27 2004

%E a(11) from _John Cerkan_, Jul 13 2017

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 20 04:16 EDT 2024. Contains 371798 sequences. (Running on oeis4.)