|
Search: id:A093286
|
|
|
| A093286 |
|
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 86. |
|
+0
1
|
|
| 0, 86, 8602, 9976, 99932, 999922, 1110002666000, 3303303088088080, 999999916, 44444404406666660660
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
Hans Havermann, Table of A093211-A093299
|
|
EXAMPLE
|
a(7) is 1110002666000 because its length-7 substrings (1110002, 1100026, 1000266, 0002666, 0026660, 0266600, 2666000) are all distinct and divisible by 86, and there is no larger number with this property
|
|
CROSSREFS
|
Cf. A093211, A093212, ..., A093299.
Sequence in context: A017802 A035738 A017749 this_sequence A093243 A067157 A077511
Adjacent sequences: A093283 A093284 A093285 this_sequence A093287 A093288 A093289
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Hans Havermann (pxp(AT)rogers.com), Mar 29 2004
|
|
|
Search completed in 0.002 seconds
|
