|
Search: id:A092527
|
|
|
| A092527 |
|
If M(n) is the n-th Mersenne prime, then a(n) is the smallest positive integer such that 2*a(n)*M(n)*M(n+1)-1 is prime. |
|
+0
2
|
|
| 1, 1, 1, 12, 1, 25, 3, 13, 7, 153, 43, 423, 52, 916, 136, 1111, 1270, 442, 2737, 975
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
EXAMPLE
|
a(4) = 12: 2(12)(2^7-1)(2^13-1)-1 = 24(127)(8191)-1 = 24966167, which is prime.
|
|
MATHEMATICA
|
p = { (* the list of Mersenne exponents in A000043 *) }; f[n_] := Block[{k = 1, q = 2^p[[n]] - 1, r = 2^p[[n + 1]] - 1}, While[ !PrimeQ[2k*q*r - 1], k++ ]; k]; Do[ Print[ f[n]], {n, 25}] (from Robert G. Wilson v Apr 10 2004)
|
|
CROSSREFS
|
Sequence in context: A040155 A036185 A013619 this_sequence A085840 A075072 A038327
Adjacent sequences: A092524 A092525 A092526 this_sequence A092528 A092529 A092530
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Ray G. Opao (1260(AT)email.com), Apr 08 2004
|
|
EXTENSIONS
|
a(21)>4200 - Robert G. Wilson v.
a(21)>12000, a(22)=6669, a(23)>10000, a(24)=5970. - Ray G. Opao (1260(AT)email.com), Apr 15 2004
|
|
|
Search completed in 0.002 seconds
|
