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