OFFSET
1,8
COMMENTS
Each second entry is 0 because the terms on the l.h.s. are all odd and the r.h.s. is even.
FORMULA
a(2n-1) = 0 for all n >= 1.
EXAMPLE
a(8) = 2 counts the two solutions prime(4) - prime(5) + prime(6) - prime(7) - prime(8) + prime(9) - prime(10) + prime(11) = -2 and prime(4) - prime(5) - prime(6) + prime(7) + prime(8) - prime(9) - prime(10) + prime(11) = -2.
PROG
(PARI) A261044(n, rhs=-2, firstprime=4)={rhs-=prime(firstprime); my(p=vector(n-1, i, prime(i+firstprime))); sum(i=1, 2^#p-1, sum(j=1, #p, (-1)^bittest(i, j-1)*p[j])==rhs)} \\ For illustrative purpose; too slow for n >> 10.
CROSSREFS
KEYWORD
nonn
AUTHOR
M. F. Hasler, Aug 08 2015
EXTENSIONS
a(25)-a(49) from Alois P. Heinz, Aug 08 2015
STATUS
approved