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 A219237 #23 Feb 21 2025 06:17:00
%S A219237 1,1,1,1,1,1,1,1,2,2,3,2,2,1,1,1,1,2,3,4,4,5,4,4,3,2,1,1,1,1,2,3,5,5,
%T A219237 7,7,8,7,7,5,5,3,2,1,1,1,1,2,3,5,6,8,9,11,11,12,11,11,9,8,6,5,3,2,1,1,
%U A219237 1,1,2,3,5,6,9,10,13,14,16,16,18,16,16,14,13,10,9,6,5,3,2,1,1
%N A219237 Coefficient of Gauss polynomials [n+4,4]_q (q-binomials).
%C A219237 The length of row n of this table is 4*n + 1 = A016813(n).
%C A219237 The sum of row n is binomial(n+4,4) = A000332(n+4), n>= 0.
%C A219237 The Gauss polynomial [n+4,4]_q := [n+4]_q/([n]_q*[4]_q), with [n]_q = Product_{j=1..n} (1-q^j) = (q;q)_n (in q-shifted factorials notation), n>=0. [n+4,4]_q = (Product_{j=(n+1)..(n+4)} (1-q^j))/(Product_{j=1..4} (1-q^j)). This is a polynomial in q (of degree 4*n) because it is the o.g.f. of the numbers p(n,4,k), the number of partitions of k into at most 4 parts, each <= n (see Andrews, p. 33 and 35). p(n,4,k) is also the number of partitions of k into at most n parts, each <= 4, due to the symmetry property [n+4,4]_q = [n+4,n]_q (Andrews, (3,3,2), p.35). With the latter interpretation p(n,4,k) is the number of solutions of the two Diophantine equations Sum_{j=1..4} j*m(j) = k and Sum_{j=0..m} m(j) = n, i.e. Sum_{j=1..m} m(j) = n - m(0), with 0 <= m(j) <= n. Therefore p(n,4,k) = [q^k] [x^n] G(4;x,q) with o.g.f. G(4;x,q) = 1/Product_{j=0..4} (1-x*q^j). Here we will call p(n,4,k) = T(n,k), n >= 0, 0 <= k <= 4*n.
%C A219237 See the comments in A008967 concerning a counting problem of Cayley (there m = 4, Theta = n and q = k), described also in the Hawkins reference (N(p->n,4,w->k) = T(n,k)) given there.
%D A219237 G. E. Andrews, The Theory of Partitions, Addison-Wesley, 1976, p. 240, 242-3.
%H A219237 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/q-BinomialCoefficient.html">q-Binomial Coefficient</a>.
%F A219237 T(n,k) = [q^k] [x^n](1/Product_{j=0..4} (1-x*q^j)), n >= 0, 0 <= k <= 4*n.
%F A219237 T(n,k) = [q^k]([n+4,4]_q), n >= 0, 0 <= k <= 4*n.
%F A219237 See the comments above.
%e A219237 The triangle T(n,k) begins:
%e A219237 n\k 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 ...
%e A219237 0: 1
%e A219237 1: 1 1 1 1 1
%e A219237 2: 1 1 2 2 3 2 2 1 1
%e A219237 3: 1 1 2 3 4 4 5 4 4 3 2 1 1
%e A219237 4: 1 1 2 3 5 5 7 7 8 7 7 5 5 3 2 1 1
%e A219237 5: 1 1 2 3 5 6 8 9 11 11 12 11 11 9 8 6 5 3 2 1 1
%e A219237 6: 1 1 2 3 5 6 9 10 13 14 16 16 18 16 16 14 13 10 9 6 5 3 2 1 1
%e A219237 Partition interpretation: T(3,5) = 4 because there are 4 partitions of 5 into at most 4 parts, each <= 3, namely 23, 113, 122 and 1112. here are also 4 partitions of 5 into at most 3 parts, each <= 4, namely 14, 23, 113 and 122. Note the conjugacy of the partitions 1112 and 14.
%e A219237 The 4 solutions of the two Diophantine equations given in a comment, with k=5 and n=3, are for (m(0), m(1), m(2), m(3), m(4)): (1,1,0,0,1), (1,0,1,1,0), (0,2,0,1,0) and (0,1,2,0,0).
%t A219237 a[0, 0] = 1; a[n_, k_] := SeriesCoefficient[ QBinomial[n+4, 4, q], {q, 0, k}]; Table[a[n, k], {n, 0, 6}, {k, 0, 4*n}] // Flatten (* _Jean-François Alcover_, Dec 04 2013 *)
%Y A219237 Cf. A000012 (as triangle for m=1), A008967 (m=2), A047971 (m=3).
%Y A219237 Cf. A000332, A016813.
%K A219237 nonn,easy,tabf
%O A219237 0,9
%A A219237 _Wolfdieter Lang_, Dec 04 2012