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 A046923 #18 Jul 22 2021 09:19:05 %S A046923 0,1,2,2,1,2,3,2,1,3,3,2,3,1,2,4,1,2,4,3,2,3,3,2,4,2,2,5,1,2,6,3,1,3, %T A046923 4,2,4,4,2,6,3,2,4,2,3,6,2,1,4,2,4,6,4,2,6,5,2,6,3,2,5,1,2,3,4,4,5,4, %U A046923 1,8,4,1,6,3,2,6,2,2,6,6,1,3,5,3,7,4,3,6,2,3,10,2,3,4,4,3,3,4,2 %N A046923 Number of ways to express 2n+1 as p+2a^2; p prime, a >= 0. %C A046923 The only zero terms appear to be for the odd numbers 1, 5777 and 5993. - _T. D. Noe_, Aug 23 2008 %C A046923 a(n) = A046922(A005408(n)). - _Reinhard Zumkeller_, Apr 03 2013 %H A046923 T. D. Noe, <a href="/A046923/b046923.txt">Table of n, a(n) for n = 0..10000</a> %H A046923 L. Hodges, <a href="https://www.jstor.org/stable/2690477">A lesser-known Goldbach conjecture</a>, Math. Mag., 66 (1993), 45-47. %H A046923 <a href="/index/Go#Goldbach">Index entries for sequences related to Goldbach conjecture</a> %o A046923 (Haskell) %o A046923 a046923 = a046922 . a005408 -- _Reinhard Zumkeller_, Apr 03 2013 %Y A046923 Cf. A042978, A046920, A046921, A046922, A060003, A143539 %K A046923 nonn %O A046923 0,3 %A A046923 _David W. Wilson_ %E A046923 Definition corrected by _T. D. Noe_, Aug 23 2008