cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A087916 Number of ordered ways to write 2n+1 as a sum of 3 odd primes.

This page as a plain text file.
%I A087916 #11 Mar 11 2015 13:31:20
%S A087916 0,0,0,0,1,3,6,7,9,12,16,18,21,27,30,30,34,36,42,46,48,48,51,63,60,64,
%T A087916 81,75,76,87,87,90,102,105,97,117,114,105,144,129,126,159,141,145,177,
%U A087916 162,160,195,186,153,207,201,171,237,210,187,255,234,222,279
%N A087916 Number of ordered ways to write 2n+1 as a sum of 3 odd primes.
%H A087916 T. D. Noe, <a href="/A087916/b087916.txt">Table of n, a(n) for n = 0..10000</a>
%t A087916 nn = 100; lim = 2*nn + 17; ps = Prime[Range[2, nn + 1]]; t = Table[0, {lim}]; Do[s = i + j + k; If[s <= lim, t[[s]]++], {i, ps}, {j, ps}, {k, ps}]; Take[t, {1, lim, 2}] (* _T. D. Noe_, Apr 10 2014 *)
%o A087916 (PARI) for(n=0, 100, t=2*n+1; c=0; for(k=2, t, for(l=2, t, for(m=2, t, tt=prime(k)+prime(l)+prime(m); if(tt>2*n+1, break); if(tt==2*n+1, c=c+1)))); print1(c", "))
%Y A087916 Cf. A007963 (unordered), A068307 (with 2).
%Y A087916 Cf. A087917.
%K A087916 nonn,easy
%O A087916 0,6
%A A087916 _Ralf Stephan_, Oct 18 2003
%E A087916 Leading zeros added by _T. D. Noe_, Apr 10 2014