|
Search: id:A093241
|
|
|
| A093241 |
|
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 41. |
|
+0
1
|
|
| 0, 82, 8615, 9881599, 999589995, 555550999990888880, 77777003333300, 8888800055555000, 888880000999990000555550000, 9999999958999999995
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
Hans Havermann, Table of A093211-A093299
|
|
EXAMPLE
|
a(4) is 9881599 because its length-4 substrings (9881, 8815, 8159, 1599) are all distinct and divisible by 41, and there is no larger number with this property
|
|
CROSSREFS
|
Cf. A093211, A093212, ..., A093299.
Sequence in context: A116123 A116142 A054214 this_sequence A120269 A015077 A015040
Adjacent sequences: A093238 A093239 A093240 this_sequence A093242 A093243 A093244
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Hans Havermann (pxp(AT)rogers.com), Mar 28 2004
|
|
|
Search completed in 0.002 seconds
|
