|
Search: id:A093264
|
|
|
| A093264 |
|
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 64. |
|
+0
1
|
|
| 0, 64, 8960, 84480000, 8844800000, 999936000000, 99999360000000, 9999993600000000
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
Hans Havermann, Table of A093211-A093299
|
|
EXAMPLE
|
a(4) is 84480000 because its length-4 substrings (8448, 4480, 4800, 8000, 0000) are all distinct and divisible by 64 and there is no larger number with this property
|
|
CROSSREFS
|
Cf. A093211, A093212, ..., A093299.
Sequence in context: A063410 A075417 A084004 this_sequence A135788 A016794 A123051
Adjacent sequences: A093261 A093262 A093263 this_sequence A093265 A093266 A093267
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Hans Havermann (pxp(AT)rogers.com), Mar 29 2004
|
|
|
Search completed in 0.002 seconds
|
