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 A046922 #16 Jul 23 2021 09:03:24 %S A046922 0,1,1,1,2,0,2,0,1,1,2,0,3,0,2,0,1,0,3,1,3,0,2,0,3,0,1,0,2,0,4,0,1,1, %T A046922 2,0,4,0,3,0,2,0,3,0,3,0,2,0,4,0,2,1,2,0,5,0,1,0,2,0,6,0,3,0,1,0,3,0, %U A046922 4,0,2,0,4,1,4,0,2,0,6,0,3,0,2,0,4,0,2,0,3,0,6,0,2,0,1,0,4,0,2 %N A046922 Number of ways to express n as p+2a^2; p prime, a >= 0. %H A046922 T. D. Noe, <a href="/A046922/b046922.txt">Table of n, a(n) for n=1..10000</a> %H A046922 L. Hodges, <a href="https://www.jstor.org/stable/2690477">A lesser-known Goldbach conjecture</a>, Math. Mag., 66 (1993), 45-47. %H A046922 <a href="/index/Go#Goldbach">Index entries for sequences related to Goldbach conjecture</a> %o A046922 (Haskell) %o A046922 a046922 n = sum $ map (a010051 . (n -)) $ takeWhile (< n) a001105_list %o A046922 -- _Reinhard Zumkeller_, Apr 03 2013 %Y A046922 Cf. A042978, A046920, A046921, A046923, A060003, A143539. %Y A046922 Cf. A010051, A001105. %K A046922 nonn %O A046922 1,5 %A A046922 _David W. Wilson_