|
Search: id:A093291
|
|
|
| A093291 |
|
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 91. |
|
+0
1
|
|
| 0, 91, 910, 90091001, 99918, 99990899990, 9999990, 1111110099999900, 999999910, 99999990091111111001
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
Hans Havermann, Table of A093211-A093299
|
|
EXAMPLE
|
a(4) is 90091001 because its length-4 substrings (9009, 0091, 0910, 9100, 1001) are all distinct and divisible by 91 and there is no larger number with this property
|
|
CROSSREFS
|
Cf. A093211, A093212, ..., A093299.
Sequence in context: A072393 A085952 A129255 this_sequence A036526 A020316 A120756
Adjacent sequences: A093288 A093289 A093290 this_sequence A093292 A093293 A093294
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Hans Havermann (pxp(AT)rogers.com), Mar 29 2004
|
|
|
Search completed in 0.002 seconds
|
