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 A296180 #12 Dec 27 2017 10:05:27
%S A296180 1,1,1,1,4,1,1,7,7,1,1,10,13,10,1,1,13,19,19,13,1,1,16,25,28,25,16,1,
%T A296180 1,19,31,37,37,31,19,1,1,22,37,46,49,46,37,22,1,1,25,43,55,61,61,55,
%U A296180 43,25,1,1,28,49,64,73,76,73,64,49,28,1
%N A296180 Triangle read by rows: T(n, k) = 3*(n - k)*k + 1, n >= 0, 0 <= k <= n.
%C A296180 This is member m = 3 of the family of triangles T(m; n, k) = m*(n - k)*k + 1, for m >= 0. For m = 0: A000012(n, k) (read as a triangle); for m = 1: A077028 (rascal), for m = 2: T(2, n+1, k+1) = A130154(n, k). Motivated by A130154 to look at this family of triangles.
%C A296180 In general the recurrence is: T(m; n, 0) = 1 and T(m; n, n) = 1 for n >= 0; T(m; n, k) = (T(m; n-1, k-1)*T(m; n-1, k) + m)/T(m; n-2, k-1), for n >= 2, k = 1..n-1.
%C A296180 The general g.f. of the sequence of column k (with leading zeros) is G(m; k, x) = (x^k/(1 - x)^2)*(1 + (m*k - 1)*x), k >= 0.
%C A296180 The general g.f. of the triangle T(m;, n, k) is GT(m; x, t) = (1 - (1 + t)*x + (m+1)*t*x^2)/((1 - t*x)*(1 - x))^2, and G(m; k, x) = (d/dt)^k GT(m; x, t)/k!|_{t=0}.
%C A296180 For a simple combinatorial interpretation see the one given in A130154 by _Rogério Serôdio_ which can be generalized to m >= 3.
%F A296180 T(n, k) = 3*(n - k)*k + 1, n >= 0, 0 <= k <= n,
%F A296180 Recurrence: T(n, 0) = 1 and T(n, n) = 1 for n >= 0; T(n, k) = (T(n-1, k-1)*T(n-1, k) + 3)/T(n-2, k-1), for n >= 2, k = 1..n-1.
%F A296180 G.f. of column k (with leading zeros): (x^k/(1 - x)^2)*(1 + (3*k-1)*x), k >= 0.
%F A296180 G.f. of triangle: (1 - (1 + t)*x + 4*t*x^2)/((1 - t*x)*(1 - x))^2 = 1 + (1+t)*x +(1 + 4*t + t^2)*x^2 + (1 + 7*t + 7*t^2 + t^3)*x^3 = ...
%e A296180 The triangle T(n, k) begins:
%e A296180 n\k 0 1 2 3 4 5 6 7 8 9 10 ...
%e A296180 0: 1
%e A296180 1: 1 1
%e A296180 2: 1 4 1
%e A296180 3: 1 7 7 1
%e A296180 4: 1 10 13 10 1
%e A296180 5: 1 13 19 19 13 1
%e A296180 6: 1 16 25 28 25 16 1
%e A296180 7: 1 19 31 37 37 31 19 1
%e A296180 8: 1 22 37 46 49 46 37 22 1
%e A296180 9: 1 25 43 55 61 61 55 43 25 1
%e A296180 10: 1 28 49 64 73 76 73 64 49 28 1
%e A296180 ...
%e A296180 Recurrence: 28 = T(6, 3) = (19*19 + 3)/13 = 28.
%t A296180 Table[3 k (n - k) + 1, {n, 0, 10}, {k, 0, n}] // Flatten (* _Michael De Vlieger_, Dec 20 2017 *)
%o A296180 (PARI) lista(nn) = for(n=0, nn, for(k=0, n, print1(3*(n - k)*k + 1, ", "))) \\ _Iain Fox_, Dec 21 2017
%Y A296180 Cf. A077028, A130154.
%Y A296180 Columns (without leading zeros): A000012, A016777, A016921, A016921, A017173, A017533, ...
%K A296180 nonn,easy,tabl
%O A296180 0,5
%A A296180 _Wolfdieter Lang_, Dec 20 2017