OFFSET
1,2
LINKS
Zak Seidov, Table of n, a(n) for n = 1..10000
EXAMPLE
Let P(n) = {2, 3, .., p_n} be the set of the first n primes. Construct S(n) = {p+q : p,q in P}. If every sum p+q were distinct, then |S(n)| would be n*(n+1)/2 = A000217(n). But in reality, for n >= 4, certain sums occur more than once. a(n) = |S(n)|. For example, P(6) = {2, 3, 5, 7, 11, 13} yields S(6) = {4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 15, 16, 18, 20, 22, 24, 26}. Thus, a(6) = 17.
MATHEMATICA
f[x_] := Prime[x]
Table[Length[Union[Flatten[Table[f[u]+f[w], {w, 1, m}, {u, 1, m}]]]], {m, 1, 75}]
CROSSREFS
KEYWORD
nonn
AUTHOR
Labos Elemer, Jun 22 2001
STATUS
approved