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 A117193 #8 Oct 06 2021 18:43:34 %S A117193 0,1,0,2,1,2,2,4,4,4,6,8,10,10,13,16,20,22,28,32,38,43,52,62,72,82,96, %T A117193 110,128,148,170,196,224,256,292,334,380,432,490,557,630,714,806,908, %U A117193 1022,1152,1294,1456,1632,1830,2049,2290,2560,2860,3188,3554,3958,4404 %N A117193 Number of partitions of n into distinct parts with an odd rank. %F A117193 a(n) = Sum(A117195(n,k)*(k mod 2): 0<=k<n). %F A117193 a(n) = A000009(n) - A117192(n). %F A117193 a(n) = A117192(n) - A003406(n). %t A117193 a[n_] := Count[IntegerPartitions[n], q_ /; OddQ[First[q] - Length[q]] && Length[q] == Length[Union[q]]]; %t A117193 Array[a, 60] (* _Jean-François Alcover_, Oct 06 2021 *) %Y A117193 Cf. A000009, A003406, A101707, A117192. %K A117193 nonn %O A117193 1,4 %A A117193 _Reinhard Zumkeller_, Mar 03 2006