Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093265
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093265 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 65. +0
1
0, 65, 8455, 669555, 99970, 5550355550, 77777705555550, 2222220055555500, 888888000555555000, 66666600005555550000 (list; graph; listen)
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: A116121 A118707 A144661 this_sequence A120801 A084225 A103345

Adjacent sequences: A093262 A093263 A093264 this_sequence A093266 A093267 A093268

KEYWORD

base,nonn

AUTHOR

Hans Havermann (pxp(AT)rogers.com), Mar 29 2004

page 1

Search completed in 0.005 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research