login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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
0, 931, 1558992, 709920775022, 9994488877, 111011222022444044888088, 888088055505507770770, 777077005550550088808800, 888800008444400004222200002111100001, 88888888819999999995, 55555500055222222000227777770007799999900099 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..11.

Hans Havermann, Table of A093211-A093299

EXAMPLE

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.

CROSSREFS

Cf. A093211, A093212, ..., A093299.

Sequence in context: A250384 A209810 A035856 * A252530 A105213 A171348

Adjacent sequences:  A093228 A093229 A093230 * A093232 A093233 A093234

KEYWORD

base,nonn

AUTHOR

Hans Havermann, Mar 28 2004

EXTENSIONS

a(11) from John Cerkan, Jul 30 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 20 04:38 EDT 2020. Contains 337264 sequences. (Running on oeis4.)