Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #5 Mar 30 2012 18:50:59
%S 1,3,5,7,12,16,24,20,26,41,33,44,51,55,54,79,64,74,69,88,121,92,101,
%T 109,113,116,124,155,152,137,144,140,160,174,165,209,197,195,201,200,
%U 206,218,251,238,229,239,230,244,236,267,295,281,299,301,307,312,313,325
%N Smallest k such that the k-th prime has exactly n distinct representations as arithmetic mean of two primes.
%C A071681(a(n))=n and A071681(m)<>n for m<a(n), A000040(a(n))=A126204(n).
%K nonn
%O 0,2
%A _Reinhard Zumkeller_, Feb 07 2008
%E Corrected description suggested by Zak Seidov, May 16 2008