|
|
A079055
|
|
Numbers of prime pairs (p,q), p<=q, such that (p+q) divides n.
|
|
1
|
|
|
0, 0, 0, 1, 1, 1, 1, 2, 1, 3, 0, 3, 1, 3, 2, 4, 0, 4, 1, 6, 2, 3, 0, 7, 2, 4, 1, 6, 0, 8, 1, 6, 1, 4, 2, 10, 0, 3, 2, 10, 0, 9, 1, 7, 4, 4, 0, 14, 2, 8, 0, 8, 0, 9, 2, 10, 1, 4, 0, 18, 1, 4, 4, 11, 2, 11, 0, 7, 1, 11, 0, 20, 1, 5, 4, 9, 1, 13, 0, 16, 2, 5, 0, 21, 2, 6, 0, 12, 0, 21, 3, 9, 1, 5, 2, 23, 0, 7
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,8
|
|
LINKS
|
|
|
FORMULA
|
|
|
MAPLE
|
N:= 100: # for a(1)..a(N)
P:= select(isprime, [2, seq(i, i=3..N, 2)]): nP:= nops(P):
V:= Vector(N):
for i from 1 to nP do
for j from i to nP do
v:= P[i]+P[j];
J:= [seq(t, t=v..N, v)];
V[J]:= V[J] +~ 1
od od:
|
|
PROG
|
(PARI) a(n)=sum(i=1, n, sum(j=1, i, if(n%(prime(i)+prime(j)), 0, 1)))
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|