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 A106314 #8 Jan 25 2017 05:41:44
%S A106314 1,1,1,1,4,1,1,4,4,1,1,4,9,4,1,1,4,9,9,4,1,1,4,9,16,9,4,1,1,4,9,16,16,
%T A106314 9,4,1,1,4,9,16,25,16,9,4,1,1,4,9,16,25,25,16,9,4,1
%N A106314 Triangle T(n,k) composed of the squares min(n,k)^2.
%F A106314 T(n,k) = A003983(n,k)^2.
%e A106314 Replacing each term in A003983 by its square, we get:
%e A106314 {1},
%e A106314 {1, 1},
%e A106314 {1, 4, 1},
%e A106314 {1, 4, 4, 1},
%e A106314 {1, 4, 9, 4, 1},
%e A106314 {1, 4, 9, 9, 4, 1},
%e A106314 {1, 4, 9, 16, 9, 4, 1},
%e A106314 {1, 4, 9, 16, 16, 9, 4, 1},
%e A106314 {1, 4, 9, 16, 25, 16, 9, 4, 1},
%e A106314 {1, 4, 9, 16, 25, 25, 16, 9, 4, 1},
%e A106314 {1, 4, 9, 16, 25, 36, 25, 16, 9, 4, 1}
%t A106314 Clear[p, n, i];
%t A106314 p[x_, n_] = Sum[x^i*If[i ==Floor[n/2] && Mod[n, 2] == 0, 0, If[i <= Floor[n/2], 2*i + 1, -(2*(n - i) + 1)]], {i, 0, n}]/(1 - x);
%t A106314 Table[CoefficientList[FullSimplify[p[x, n]], x], {n, 1, 11}];
%t A106314 Flatten[%]
%Y A106314 Cf. A003983, A106314, A005993 (row sums).
%K A106314 nonn,tabl,easy
%O A106314 1,5
%A A106314 _Gary W. Adamson_, Apr 28 2005
%E A106314 Additional comments from _Roger L. Bagula_ and _Gary W. Adamson_, Apr 02 2009