|
|
A178127
|
|
Lesser of twin Ramanujan primes.
|
|
6
|
|
|
149, 179, 227, 239, 347, 431, 569, 599, 641, 821, 1019, 1049, 1061, 1427, 1487, 1607, 1787, 1997, 2081, 2129, 2237, 2267, 2657, 2687, 2711, 2789, 2999, 3167, 3257, 3299, 3359, 3527, 3539, 3581, 3671, 3917, 4091, 4127, 4229, 4241, 4337, 4547, 4637, 4649
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
By definition, a number p is a member if p and p+2 are Ramanujan primes A104272.
Conjecture: For all n > 570, more than 1/4 of the twin prime pairs < n are both Ramanujan primes.
Motivation for the conjecture is in "Ramanujan primes and Bertrand's postulate" Section 7.
See A001359 and A104272 for additional comments, links, and references.
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
a(1) = 149 because (149,151) is the 1st pair of twin primes both of which are Ramanujan primes.
11 is not a member even though 11 and 13 are twin primes and 11 is a Ramanujan prime, because 13 is not also a Ramanujan prime.
|
|
MAPLE
|
n := 1:
for i from 1 do
n := n+1 ;
end if;
|
|
MATHEMATICA
|
nn = 1000; R = Table[0, {nn}]; s = 0;
Do[If[PrimeQ[k], s++]; If[PrimeQ[k/2], s--]; If[s < nn, R[[s + 1]] = k], {k, Prime[3*nn]}];
twins1 = Position[A104272 // Differences, 2] // Flatten;
|
|
PROG
|
(Perl) use ntheory ":all"; my $r = ramanujan_primes(1e5); my @rt = @$r[grep { $r->[$_+1]-$r->[$_]==2 } 0..$#$r-1]; say "@rt"; # Dana Jacobsen, Sep 06 2015
|
|
CROSSREFS
|
Cf. A181678 (number of twin Ramanujan prime pairs less than 10^n).
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|