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.
%I A088627 #11 Dec 05 2013 19:56:34 %S A088627 1,1,2,0,2,2,0,1,2,0,2,1,0,2,4,0,1,2,0,2,4,0,1,1,0,2,1,0,2,4,0,0,2,0, %T A088627 4,2,0,1,4,0,2,2,0,2,3,0,0,1,0,2,4,0,1,2,0,2,2,0,1,3,0,0,2,0,4,3,0,1, %U A088627 3,0,1,0,0,2,3,0,2,2,0,1,2,0,1,3,0,2,2,0,1,3,0,1,1,0,4,2,0,2,4,0,1,2,0,1,8 %N A088627 Let 2n = r*s. Then a(n) = number of primes of the form r+s (r= 1 and s = 2n contributes 1 to the count if 2n+1 is prime). %C A088627 Only even numbers yield primes hence odd numbers are not considered. %C A088627 There is an upper bound: if n has only k different prime divisors > 2, then a(n) <= 2^k. - _Matthias Engelhardt_, Jan 05 2004 %H A088627 T. D. Noe, <a href="/A088627/b088627.txt">Table of n, a(n) for n=1..10000</a> %H A088627 M. Engelhardt, <a href="http://nqueens.de/otherTopics/SumOfFactorPrimes.en.html">Number of Primes arising as Sum of a Factorization</a>. %e A088627 a(9) = 2 18 = 1*18, 1+18= 19 and 18 = 2*9, 2+9 = 11, two primes arise. %Y A088627 Cf. A091350. %K A088627 nonn %O A088627 1,3 %A A088627 _Amarnath Murthy_, Oct 19 2003 %E A088627 More terms from _Matthias Engelhardt_, Jan 05 2004 %E A088627 More terms from _David Wasserman_, Aug 15 2005