Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #5 Dec 07 2020 01:37:24
%S 0,0,2,1,1,2,2,2,3,2,3,3,3,3,3,3,3,4,5,4,4,4,4,4,4,4,5,5,5,5,5,5,6,5,
%T 5,5,5,6,6,6,6,6,6,6,6,6,6,6,6,6,8,7,7,7,7,7,7,7,7,7,7,7,7,7,7,8,8,8,
%U 8,8,8,8,9,8,8,8,8,8,8,8,8,8,9,9,9,9,9,9,9,9,9,9
%N Total number of nonzero squares in the partitions of n into 2 parts.
%H <a href="/index/Par#part">Index entries for sequences related to partitions</a>
%F a(n) = A339184(n) + A339183(n).
%e a(8) = 3; The partitions of 8 into two parts are (7,1), (6,2), (5,3) and (4,4). There are 3 total nonzero squares among the parts (namely 1, 4 and 4 ), so a(8) = 3.
%e a(9) = 2; The partitions of 9 into two parts are (8,1), (7,2), (6,3) and (5,4). Since 1 and 4 are the only nonzero squares among all parts, a(9) = 2.
%t Table[Sum[Floor[Sqrt[i]] - Floor[Sqrt[i - 1]] + Floor[Sqrt[n - i]] - Floor[Sqrt[n - i - 1]], {i, Floor[n/2]}], {n, 0, 100}]
%Y Cf. A339183 (number of smaller parts), A339184 (number of larger parts).
%K nonn,easy
%O 0,3
%A _Wesley Ivan Hurt_, Nov 26 2020