|
| |
|
|
A093261
|
|
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 61.
|
|
0
| | |
|
|
|
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 * A062638 A197105 A195216
Adjacent sequences: A093258 A093259 A093260 * A093262 A093263 A093264
|
|
|
KEYWORD
| base,nonn
|
|
|
AUTHOR
| Hans Havermann (gladhobo(AT)teksavvy.com), Mar 29 2004
|
| |
|
|
