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 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

LINKS

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: A118707 A144661 A176370 * A120801 A084225 A177652

Adjacent sequences:  A093262 A093263 A093264 * A093266 A093267 A093268

KEYWORD

base,nonn

AUTHOR

Hans Havermann (gladhobo(AT)teksavvy.com), Mar 29 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 23:21 EST 2012. Contains 205860 sequences.