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 A093567 #19 Oct 01 2017 03:05:56
%S A093567 0,1,14,75,265,735,1736,3654,7050,12705,21670,35321,55419,84175,
%T A093567 124320,179180,252756,349809,475950,637735,842765,1099791,1418824,
%U A093567 1811250,2289950,2869425,3565926,4397589,5384575,6549215,7916160,9512536
%N A093567 Binomial (Binomial (n,2), 3) - Binomial (Binomial (n,3), 2).
%C A093567 All terms are positive: A093566 >= A054563 ==> C( C(n,2), 3) >= C( C(n,3), 2) ==> n^2*(n^4 + 3n^3 -35n^2 + 69n -38)/144 >= 0 ==> (n - 2)(n - 1)(n^2 + 6n - 19) ==> 0 which it is for all n >= 2.
%H A093567 Solomon W. Golomb, <a href="http://www.jstor.org/stable/2321859">Iterated binomial coefficients</a>, Amer. Math. Monthly, 87 (1980), 719-727.
%H A093567 <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (7,-21,35,-35,21,-7,1).
%F A093567 a(n) = A093566(n) - A054563(n).
%F A093567 G.f.: x^3*(-1-7*x+2*x^2+x^3)/(x-1)^7. - _R. J. Mathar_, Dec 08 2010
%p A093567 A093567:=n->binomial(binomial(n, 2), 3) - binomial(binomial(n, 3), 2); seq(A093567(n), n=2..30); # _Wesley Ivan Hurt_, Feb 02 2014
%t A093567 Table[ Binomial[ Binomial[n, 2], 3] - Binomial[ Binomial[n, 3], 2], {n, 2, 34}]
%t A093567 LinearRecurrence[{7,-21,35,-35,21,-7,1},{0,1,14,75,265,735,1736},40] (* _Harvey P. Dale_, Jun 12 2016 *)
%o A093567 (PARI) a(n) = binomial(binomial(n,2), 3) - binomial(binomial(n,3), 2); \\ _Michel Marcus_, Oct 01 2017
%Y A093567 Cf. A054563, A093566.
%K A093567 nonn
%O A093567 2,3
%A A093567 _Robert G. Wilson v_ and _Santi Spadaro_, Mar 31 2004