|
Search: id:A093240
|
|
|
| A093240 |
|
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 40. |
|
+0
1
|
|
| 0, 800, 96000, 9960000, 999600000, 99996000000, 9999960000000
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
Hans Havermann, Table of A093211-A093299
|
|
EXAMPLE
|
a(3) is 96000 because its length-3 substrings (960, 600, 000) are all distinct and divisible by 40, and there is no larger number with this property
|
|
CROSSREFS
|
Cf. A093211, A093212, ..., A093299.
Sequence in context: A015065 A097206 A093280 this_sequence A093220 A035757 A023100
Adjacent sequences: A093237 A093238 A093239 this_sequence A093241 A093242 A093243
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Hans Havermann (pxp(AT)rogers.com), Mar 28 2004
|
|
|
Search completed in 0.002 seconds
|
