login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A093285 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 85. 0
0, 85, 4255, 9945, 99960, 999940, 11101005550500, 99999950, 888800800555500500, 9999999930, 99999999980, 333333033330555555055550, 22222222020205555555505050, 7777777707070055555555050500, 999999999999920, 5555555555500050555555555550005, 9999999999999999055555555555555550 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(7) is 11101005550500 because its length-7 substrings (1110100, 1101005, 1010055, 0100555, 1005550, 0055505, 0555050, 5550500) are all distinct and divisible by 85 and there is no larger number with this property.

CROSSREFS

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

Sequence in context: A017748 A158796 A201796 * A011813 A006106 A015338

Adjacent sequences:  A093282 A093283 A093284 * A093286 A093287 A093288

KEYWORD

base,nonn

AUTHOR

Hans Havermann, Mar 29 2004

EXTENSIONS

a(11)-a(13) from John Cerkan, Jul 05 2017

a(14)-a(17) from John Cerkan, Jan 04 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 April 23 02:15 EDT 2019. Contains 322380 sequences. (Running on oeis4.)