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 A154804 #8 Dec 11 2024 15:03:23 %S A154804 0,1,1,2,1,2,2,2,3,3,2,4,2,2,4,3,3,4,2,3,5,4,3,6,4,3,6,3,3,7,3,5,6,3, %T A154804 5,7,5,5,7,5,4,9,4,4,10,4,4,7,4,6,9,6,5,9,7,7,11,6,5,12,3,5,10,4,7,10, %U A154804 5,5,9,8,7,11,5,5,13,5,8,11,5,8,10,6,5,14,9,6,12,7,6,15,7,8,13,5,8,12,7,9 %N A154804 Number of ways to represent 2*n as the sum of two distinct primes (counting 1 as a prime). %C A154804 Number of ways to represent 2*n as the sum of two distinct noncomposite numbers. - _Omar E. Pol_, Dec 11 2024 %F A154804 a(n) = A101264(n-1) + A061357(n). [From _R. J. Mathar_, Jan 21 2009] %F A154804 a(n) = A001031(n) - A080339(n). %Y A154804 Cf. A008578, A154720, A154721, A154722, A154723. %K A154804 nonn %O A154804 1,4 %A A154804 _Omar E. Pol_, Jan 16 2009 %E A154804 More terms from _R. J. Mathar_, Jan 21 2009 %E A154804 Edited by _Franklin T. Adams-Watters_, Jan 31 2009