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 A095662 #10 Jul 31 2015 12:56:34
%S A095662 3,19,70,196,462,966,1848,3300,5577,9009,14014,21112,30940,44268,
%T A095662 62016,85272,115311,153615,201894,262108,336490,427570,538200,671580,
%U A095662 831285,1021293,1246014,1510320,1819576,2179672,2597056,3078768,3632475
%N A095662 Seventh column (m=6) of (1,3)-Pascal triangle A095660.
%C A095662 If Y is a 3-subset of an n-set X then, for n>=8, a(n-8) is the number of 6-subsets of X having at most one element in common with Y. - _Milan Janjic_, Nov 23 2007
%H A095662 <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (7, -21, 35, -35, 21, -7, 1).
%F A095662 G.f.: (3-2*x)/(1-x)^7.
%F A095662 a(n)= binomial(n+5, 5)*(n+18)/6 = 3*b(n)-2*b(n-1), with b(n):=binomial(n+6, 6); cf. A000579.
%F A095662 a(0)=3, a(1)=19, a(2)=70, a(3)=196, a(4)=462, a(5)=966, a(6)=1848, a(n)=7*a(n-1)-21*a(n-2)+35*a(n-3)-35*a(n-4)+21*a(n-5)-7*a(n-6)+a(n-7). - _Harvey P. Dale_, Mar 30 2014
%t A095662 CoefficientList[Series[(3-2x)/(1-x)^7,{x,0,40}],x] (* or *) LinearRecurrence[{7,-21,35,-35,21,-7,1},{3,19,70,196,462,966,1848},40] (* _Harvey P. Dale_, Mar 30 2014 *)
%Y A095662 Sixth column: A000574. Eighth column: A095663.
%K A095662 nonn,easy
%O A095662 0,1
%A A095662 _Wolfdieter Lang_, Jun 11 2004