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 A117192 #8 Oct 06 2021 18:44:20 %S A117192 1,0,2,0,2,2,3,2,4,6,6,7,8,12,14,16,18,24,26,32,38,46,52,60,70,83,96, %T A117192 112,128,148,170,194,224,256,293,334,380,432,492,556,630,712,804,908, %U A117192 1026,1152,1296,1454,1632,1828,2048,2292,2560,2858,3190,3554,3959,4404 %N A117192 Number of partitions of n into distinct parts with an even rank. %F A117192 a(n) = Sum(A117195(n,k)*(1 - k mod 2): 0<=k<n). %F A117192 a(n) = A117194(n)+A010054(n) = A000009(n)-A117193(n) = A117193(n)+A003406(n). %t A117192 a[n_] := Count[IntegerPartitions[n], q_ /; EvenQ[First[q] - Length[q]] && Length[q] == Length[Union[q]]]; %t A117192 Array[a, 60] (* _Jean-François Alcover_, Oct 06 2021 *) %Y A117192 Cf. A000009, A003406, A101709, A101708, A117193, A117194, A117195. %K A117192 nonn %O A117192 1,3 %A A117192 _Reinhard Zumkeller_, Mar 03 2006