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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A093265 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 65. 0
0, 65, 8455, 669555, 99970, 5550355550, 77777705555550, 2222220055555500, 888888000555555000, 66666600005555550000, 99999999970, 55555555055055555555055, 77777777777705555555555550, 2222222222220055555555555500, 888888888888000555555555555000 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(4) is 669555 because its length-4 substrings (6695, 6955, 9555) are all distinct and divisible by 65 and there is no larger number with this property.

CROSSREFS

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

Sequence in context: A296144 A251150 A176370 * A264541 A323316 A120801

Adjacent sequences:  A093262 A093263 A093264 * A093266 A093267 A093268

KEYWORD

base,nonn

AUTHOR

Hans Havermann, Mar 29 2004

EXTENSIONS

a(11)-a(15) 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 November 22 06:14 EST 2019. Contains 329388 sequences. (Running on oeis4.)