|
|
A337772
|
|
Number of Goldbach partitions (p,q) of 2n such that any one of p+-1 or q+-1 is a perfect square.
|
|
1
|
|
|
0, 1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 2, 1, 2, 1, 1, 3, 2, 0, 2, 1, 2, 3, 3, 2, 1, 1, 2, 2, 2, 1, 3, 2, 1, 2, 1, 2, 3, 3, 1, 1, 3, 1, 2, 2, 1, 1, 2, 1, 2, 1, 2, 3, 3, 2, 3, 3, 2, 2, 3, 0, 2, 2, 0, 3, 2, 2, 1, 1, 2, 3, 4, 1, 2, 1, 1, 4, 2, 0, 2, 2, 1, 2, 4, 1, 2, 3, 2, 1, 2, 1, 4, 2
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,5
|
|
LINKS
|
|
|
FORMULA
|
a(n) = Sum_{i=1..n} sign(s(i-1) + s(i+1) + s(2*n-i-1) + s(2*n-i+1)) * c(i) * c(2*n-i), where s is the square characteristic (A010052) and c is the prime characteristic (A010051).
|
|
EXAMPLE
|
a(5) = 2; 2*5 = 10 has two Goldbach partitions, (7,3) and (5,5). Since 3+1 = 4 is a square and 5-1 = 4 is a square, a(5) = 2.
a(17) = 3; 2*17 = 34 has the four Goldbach partitions, (31,3), (29,5), (23,11) and (17,17). Since 3+1 = 4 (square), 5-1 = 4 (square), and 17-1 = 16 (square), a(17) = 3.
|
|
MATHEMATICA
|
Table[Sum[Sign[(Floor[Sqrt[i - 1]] - Floor[Sqrt[i - 2]]) + (Floor[Sqrt[2 n - i - 1]] - Floor[Sqrt[2 n - i - 2]]) + (Floor[Sqrt[i + 1]] - Floor[Sqrt[i]]) + (Floor[Sqrt[2 n - i + 1]] - Floor[Sqrt[2 n - i]])] * (PrimePi[i] - PrimePi[i - 1]) (PrimePi[2 n - i] - PrimePi[2 n - i - 1]), {i, n}], {n, 100}]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|