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 A101709 #7 May 10 2013 12:45:39 %S A101709 1,0,2,1,3,2,7,5,11,10,20,20,34,35,57,62,92,104,151,171,237,274,371, %T A101709 433,571,670,870,1025,1306,1543,1947,2299,2864,3387,4183,4943,6052, %U A101709 7143,8688,10242,12371,14566,17503,20567,24583,28841,34319,40188,47618,55654,65700,76643,90149,104968 %N A101709 Number of partitions of n having nonnegative even rank (the rank of a partition is the largest part minus the number of parts). %C A101709 A101709(n)=A101707(n)+A047993(n). A000041(n)=2*A101707(n)+A101708(n)+A101709(n). %D A101709 George E. Andrews, The Theory of Partitions, Addison-Wesley, Reading, Mass., 1976. %F A101709 G.f.: Sum((-1)^(k+1)*x^((3*k^2-k)/2)/(1+x^k), k=1..infinity)/Product(1-x^k, k=1..infinity). - _Vladeta Jovovic_, Dec 20 2004 %e A101709 a(5)=3 because the partitions of 5 with nonnegative even ranks are 5 (rank=4), 41 (rank=2) and 311 (rank=0). %Y A101709 Cf. A000041, A101707, A101708, A047993. %Y A101709 Cf. A101198-A101200. %K A101709 nonn %O A101709 1,3 %A A101709 _Emeric Deutsch_, Dec 12 2004 %E A101709 More terms, _Joerg Arndt_, Oct 07 2012