|
Search: id:A002515
|
|
|
| A002515 |
|
Lucasian primes: p == 3 (mod 4) with 2p+1 prime.
(Formerly M2884 N2039)
|
|
+0
22
|
|
| 3, 11, 23, 83, 131, 179, 191, 239, 251, 359, 419, 431, 443, 491, 659, 683, 719, 743, 911, 1019, 1031, 1103, 1223, 1439, 1451, 1499, 1511, 1559, 1583, 1811, 1931, 2003, 2039, 2063, 2339, 2351, 2399, 2459, 2543, 2699, 2819, 2903, 2939, 2963, 3023, 3299
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
2p+1 divides M(p), i.e. A000225(p), the p-th Mersenne number. - Lekraj Beedassy (blekraj(AT)yahoo.com), Jun 23 2003
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
A. J. C. Cunningham, On Mersenne's numbers, Reports of the British Association for the Advancement of Science, 1894, pp. 563-564.
L. E. Dickson, History of the Theory of Numbers. Carnegie Institute Public. 256, Washington, DC, Vol. 1, 1919; Vol. 2, 1920; Vol. 3, 1923, see vol. 1, p. 27.
Daniel Shanks, "Solved and Unsolved Problems in Number Theory," Fourth Edition, Chelsea Publishing Co., NY, 1993, page 28.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..1000
|
|
MATHEMATICA
|
Select[Range[10^4], Mod[ #, 4] == 3 && PrimeQ[ # ] && PrimeQ[2# + 1] & ]
|
|
CROSSREFS
|
Sequence in context: A165635 A032026 A158034 this_sequence A096297 A081857 A120088
Adjacent sequences: A002512 A002513 A002514 this_sequence A002516 A002517 A002518
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Mar 07 2002
|
|
|
Search completed in 0.002 seconds
|
