|
|
A069879
|
|
Number of pairs {i,j} with i different from j; 1<=i<=n; 1<= j <=n such that i+j is a prime number.
|
|
1
|
|
|
0, 2, 4, 8, 10, 14, 18, 22, 28, 36, 42, 50, 56, 62, 70, 80, 88, 96, 104, 112, 122, 134, 144, 156, 168, 180, 194, 208, 220, 234, 248, 262, 276, 292, 308, 326, 344, 362, 380, 400, 418, 438, 456, 474, 494, 514, 532, 550, 570, 590, 612, 636, 658, 682, 708, 734
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
FORMULA
|
|
|
MAPLE
|
with(numtheory):
b:= proc(n) option remember; `if`(n=0, 0,
b(n-1)+pi(2*n-1)-pi(n))
end:
a:= n-> 2*b(n):
|
|
MATHEMATICA
|
Table[2*Count[Subsets[Range[n], {2}], _?(PrimeQ[Total[#]]&)], {n, 50}] (* Harvey P. Dale, Jan 23 2015 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|