|
| |
|
|
A093266
|
|
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 66.
|
|
0
| | |
|
|
|
OFFSET
| 1,2
|
|
|
LINKS
| Hans Havermann, Table of A093211-A093299
|
|
|
EXAMPLE
| a(4) is 8844884 because its length-4 substrings (8844, 8448, 4488, 4884) are all distinct and divisible by 66 and there is no larger number with this property
|
|
|
CROSSREFS
| Cf. A093211, A093212, ..., A093299.
Sequence in context: A097316 A099639 A003555 * A197439 A127706 A167778
Adjacent sequences: A093263 A093264 A093265 * A093267 A093268 A093269
|
|
|
KEYWORD
| base,nonn
|
|
|
AUTHOR
| Hans Havermann (gladhobo(AT)teksavvy.com), Mar 29 2004
|
| |
|
|
