|
Search: id:A093230
|
|
|
| A093230 |
|
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 30. |
|
+0
1
|
|
| 0, 900, 99000, 9990000, 999900000, 99999000000, 9999990000000, 999999900000000, 99999999000000000, 9999999990000000000
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
Hans Havermann, Table of A093211-A093299
|
|
EXAMPLE
|
a(3) is 99000 because its length-3 substrings (990, 900, 000) are all distinct and divisible by 30 and there is no larger number with this property
|
|
CROSSREFS
|
Cf. A093211, A093212, ..., A093299, A093798.
Sequence in context: A162143 A069096 A119541 this_sequence A093798 A093218 A093215
Adjacent sequences: A093227 A093228 A093229 this_sequence A093231 A093232 A093233
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Hans Havermann (pxp(AT)rogers.com), Mar 28 2004
|
|
|
Search completed in 0.002 seconds
|
