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!)
A093271 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 71. 0
0, 71, 1426, 6603550, 9009940044, 800880400440200220100110, 10111115055555, 3300030388000808, 111110101333330303999990909, 55555050508888808080, 555550505009999909090022222020200, 888888888084222222222021, 22222022202205555505550550 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(4) is 6603550 because its length-4 substrings (6603, 6035, 0355, 3550) are all distinct and divisible by 71 and there is no larger number with this property.

CROSSREFS

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

Sequence in context: A241940 A254872 A198449 * A201608 A225741 A049295

Adjacent sequences:  A093268 A093269 A093270 * A093272 A093273 A093274

KEYWORD

base,nonn

AUTHOR

Hans Havermann, Mar 29 2004

EXTENSIONS

a(11)-a(13) from John Cerkan, Jan 08 2018

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 February 24 04:36 EST 2020. Contains 332197 sequences. (Running on oeis4.)