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!)
A093231 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 31. 0

%I #8 Jul 30 2017 16:23:47

%S 0,931,1558992,709920775022,9994488877,111011222022444044888088,

%T 888088055505507770770,777077005550550088808800,

%U 888800008444400004222200002111100001,88888888819999999995,55555500055222222000227777770007799999900099

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

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

%e a(3) is 1558992 because its length-3 substrings (155, 558, 589, 899, 992) are all distinct and divisible by 31 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(11) from _John Cerkan_, Jul 30 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 March 28 22:04 EDT 2024. Contains 371254 sequences. (Running on oeis4.)