Search: id:A002515
Results 1-1 of 1 results found.

%I A002515 M2884 N2039
%S A002515 3,11,23,83,131,179,191,239,251,359,419,431,443,491,659,683,719,743,
%T A002515 911,1019,1031,1103,1223,1439,1451,1499,1511,1559,1583,1811,1931,2003,
%U A002515 2039,2063,2339,2351,2399,2459,2543,2699,2819,2903,2939,2963,3023,3299
%N A002515 Lucasian primes: p == 3 (mod 4) with 2p+1 prime.
%C A002515 2p+1 divides M(p), i.e. A000225(p), the p-th Mersenne number. - Lekraj 
               Beedassy (blekraj(AT)yahoo.com), Jun 23 2003
%D A002515 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A002515 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 
               (includes this sequence).
%D A002515 A. J. C. Cunningham, On Mersenne's numbers, Reports of the British Association 
               for the Advancement of Science, 1894, pp. 563-564.
%D A002515 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.
%D A002515 Daniel Shanks, "Solved and Unsolved Problems in Number Theory," Fourth 
               Edition, Chelsea Publishing Co., NY, 1993, page 28.
%H A002515 T. D. Noe, <a href="b002515.txt">Table of n, a(n) for n=1..1000</a>
%t A002515 Select[Range[10^4], Mod[ #, 4] == 3 && PrimeQ[ # ] && PrimeQ[2# + 1] 
               & ]
%Y A002515 Sequence in context: A165635 A032026 A158034 this_sequence A096297 A081857 
               A120088
%Y A002515 Adjacent sequences: A002512 A002513 A002514 this_sequence A002516 A002517 
               A002518
%K A002515 nonn
%O A002515 1,1
%A A002515 N. J. A. Sloane (njas(AT)research.att.com).
%E A002515 More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Mar 07 2002

Search completed in 0.002 seconds