|
Search: id:A093261
|
|
|
| A093261 |
|
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 61. |
|
+0
1
|
|
| 0, 61, 8549, 9943, 99003660024400, 700707600606, 55055558808888, 8888480866663606, 550555500770777700, 555055500599909990094440444004
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
Hans Havermann, Table of A093211-A093299
|
|
EXAMPLE
|
a(5) is 99003660024400 because its length-5 substrings (99003, 90036, 00366, 03660, 36600, 66002, 60024, 00244, 02440, 24400) are all distinct and divisible by 61 and there is no larger number with this property
|
|
CROSSREFS
|
Cf. A093211, A093212, ..., A093299.
Sequence in context: A015288 A103915 A090823 this_sequence A062638 A099683 A057998
Adjacent sequences: A093258 A093259 A093260 this_sequence A093262 A093263 A093264
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Hans Havermann (pxp(AT)rogers.com), Mar 29 2004
|
|
|
Search completed in 0.002 seconds
|
