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 A026920 #21 Aug 23 2019 04:51:13
%S A026920 1,0,1,1,0,1,0,1,0,1,1,1,1,0,1,0,2,1,1,0,1,1,1,3,1,1,0,1,0,2,2,3,1,1,
%T A026920 0,1,1,2,4,3,3,1,1,0,1,0,3,3,5,3,3,1,1,0,1,1,2,6,5,6,3,3,1,1,0,1,0,3,
%U A026920 5,8,6,6,3,3,1,1,0,1,1,3,8,8,10,7,6,3,3,1,1,0,1,0,4,7,12,10,11,7,6,3,3,1,1,0,1
%N A026920 Triangular array O by rows: O(n,k) = number of partitions of n into an odd number of parts, the greatest being k.
%C A026920 The reversed rows (see example) stabilize to A027187. [_Joerg Arndt_, May 12 2013]
%F A026920 G.f.: sum(n>=0, q^(2*n+1)/prod(k=1..2*n+1, 1-z*q^k) ), setting z=1 gives g.f. for A027193. [_Joerg Arndt_, May 12 2013]
%F A026920 O(n,k) + A026921(n,k) = A008284(n,k). - _R. J. Mathar_, Aug 23 2019
%e A026920 G.f. = (0)*q^0 +
%e A026920 (1) * q^1
%e A026920 (0* + 1*z^1) * q^2
%e A026920 (1* + 0*z^1 + 1*z^2) * q^3
%e A026920 (0* + 1*z^1 + 0*z^2 + 1*z^3) * q^4
%e A026920 (1* + 1*z^1 + 1*z^2 + 0*z^3 + 1*z^4) * q^5
%e A026920 (0* + 2*z^1 + 1*z^2 + 1*z^3 + 0*z^4 + 1*z^5) * q^6
%e A026920 (1* + 1*z^1 + 3*z^2 + 1*z^3 + 1*z^4 + 0*z^5 + 1*z^6) * q^7
%e A026920 ... [_Joerg Arndt_, May 12 2013]
%e A026920 Triangle starts:
%e A026920 01: [1]
%e A026920 02: [0, 1]
%e A026920 03: [1, 0, 1]
%e A026920 04: [0, 1, 0, 1]
%e A026920 05: [1, 1, 1, 0, 1]
%e A026920 06: [0, 2, 1, 1, 0, 1]
%e A026920 07: [1, 1, 3, 1, 1, 0, 1]
%e A026920 08: [0, 2, 2, 3, 1, 1, 0, 1]
%e A026920 09: [1, 2, 4, 3, 3, 1, 1, 0, 1]
%e A026920 10: [0, 3, 3, 5, 3, 3, 1, 1, 0, 1]
%e A026920 11: [1, 2, 6, 5, 6, 3, 3, 1, 1, 0, 1]
%e A026920 12: [0, 3, 5, 8, 6, 6, 3, 3, 1, 1, 0, 1]
%e A026920 13: [1, 3, 8, 8, 10, 7, 6, 3, 3, 1, 1, 0, 1]
%e A026920 14: [0, 4, 7, 12, 10, 11, 7, 6, 3, 3, 1, 1, 0, 1]
%e A026920 15: [1, 3, 11, 13, 16, 12, 12, 7, 6, 3, 3, 1, 1, 0, 1]
%e A026920 16: [0, 4, 9, 18, 17, 18, 13, 12, 7, 6, 3, 3, 1, 1, 0, 1]
%e A026920 17: [1, 4, 13, 19, 25, 21, 20, 14, 12, 7, 6, 3, 3, 1, 1, 0, 1]
%e A026920 18: [0, 5, 12, 24, 27, 30, 23, 21, 14, 12, 7, 6, 3, 3, 1, 1, 0, 1]
%e A026920 19: [1, 4, 17, 26, 37, 34, 34, 25, 22, 14, 12, 7, 6, 3, 3, 1, 1, 0, 1]
%e A026920 ... [_Joerg Arndt_, May 12 2013]
%o A026920 (PARI)
%o A026920 N = 20; q = 'q + O('q^N);
%o A026920 gf = sum(n=0,N, q^(2*n+1)/prod(k=1, 2*n+1, 1-'z*q^k) );
%o A026920 v = Vec(gf);
%o A026920 { for(n=1, #v, /* print triangle starting with row 1: */
%o A026920 p = Pol('c0 +'cn*'z^n + v[n],'z);
%o A026920 p = polrecip(p);
%o A026920 p = Vec(p);
%o A026920 p[1] -= 'c0;
%o A026920 p = vector(#p-1, j, p[j]);
%o A026920 print(p);
%o A026920 ); }
%o A026920 /* _Joerg Arndt_, May 12 2013 */
%Y A026920 O(n, k) = E(n-k, 1)+E(n-k, 2)+...+E(n-k, m), where m=MIN{k, n-k}, n >= 2, E given by A026921.
%Y A026920 Columns k=2..6: A026922, A026923, A026924, A026925, A026926.
%K A026920 nonn,tabl
%O A026920 1,17
%A A026920 _Clark Kimberling_