|
Search: id:A071057
|
|
|
| A071057 |
|
Smallest number m such that m = p(i+1) mod p(i) for 1<=i<=n. |
|
+0
3
|
|
| 1, 5, 17, 137, 1817, 20297, 350627, 8518787, 86116307, 5886530927, 193507634597, 6210322338497, 124942132495457, 3471695031294767, 42719979026304857, 3117168891968761907, 850435289298909924887, 91220171746546903961177
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
MATHEMATICA
|
Table[ ChineseRemainder[ Table[ Prime[i + 1], {i, 1, n}], Table[ Prime[i], {i, 1, n}]], {n, 1, 20}]
|
|
CROSSREFS
|
Cf. A053664.
Sequence in context: A012263 A076448 A096310 this_sequence A119769 A090886 A097490
Adjacent sequences: A071054 A071055 A071056 this_sequence A071058 A071059 A071060
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Robert G. Wilson v (rgwv(AT)rgwv.com), May 25 2002
|
|
|
Search completed in 0.005 seconds
|
