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 #1 May 16 2003 03:00:00
%S 0,1,1,2,2,3,3,5,4,6,4,5,5,9,10,6,11,6,7,13,7,14,8,8,8,9,9,10,10,11,
%T 19,10,13,11,20,21,12,22,23,12,16,13,13,14,23,24,14,15,15,28,16,19,29,
%U 30,31,17,32,16,18,21,20,17,19,18,21,36,23,20,19,38,17,39,40,20,41,18,21
%N Let S_n ={p_n + q : p_n is the n-th odd prime and q runs through odd primes not greater than p_n}; sequence gives size of S_n intersect S_(n+1).
%e S_5 = {16,18,20,24,26} and S_6 = {20,22,24,28,30,34} so a(5)=2.
%K nonn,easy
%O 1,4
%A Jeremiah K. Hower (jhower(AT)vt.edu), May 07 2002
%E More terms from Larry Reeves (larryr(AT)acm.org), Sep 26 2002