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 A071754 #18 Jan 01 2024 13:56:42
%S A071754 1,2,2,3,4,5,6,7,7,7,7,7,8,9,10,10,11,12,13,13,14,14,14,15,16,16,16,
%T A071754 16,16,17,17,17,18,19,19,20,21,22,23,24,24,25,25,26,27,27,27,27,28,29,
%U A071754 29,30,31,32,33,33,34,34,34,34,35,36,36,37,37,37,37,38,39,40,40,41,42,43
%N A071754 a(n) = Sum_{k=0..n} pp(k) where pp(k) is the parity of p(k) the k-th partition number = A040051(k).
%C A071754 It appears that there is a constant A > 0 such that for any n>1: An/log(n) < 2a(n) - n < n/Log(n) and that lim n ->infinity (2*a(n) - n )/(n/Log(n)) exists. - _Benoit Cloitre_, Jan 29 2006
%H A071754 T. D. Noe, <a href="/A071754/b071754.txt">Table of n, a(n) for n = 0..1000</a>
%t A071754 Table[ Mod[ PartitionsP[n], 2], {n, 0, 73}] // Accumulate (* _Jean-François Alcover_, Jun 18 2013 *)
%o A071754 (PARI) \ps100 s=0; for(n=0,80,s=s+(1-(-1)^polcoeff(1/eta(x),n,x))/2; print1(s,", "))
%o A071754 (PARI) a(n) = sum(k=0, n, numbpart(k) % 2); \\ _Michel Marcus_, Feb 24 2023
%Y A071754 Cf. A040051.
%K A071754 easy,nonn
%O A071754 0,2
%A A071754 _Benoit Cloitre_, Jun 24 2002