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 A095664 #8 May 11 2013 06:48:37
%S A095664 3,25,117,405,1155,2871,6435,13299,25740,47190,82654,139230,226746,
%T A095664 358530,552330,831402,1225785,1773783,2523675,3535675,4884165,6660225,
%U A095664 8974485,11960325,15777450,20615868,26700300,34295052,43709380,55303380,69494436,86764260,107666559,132835365,162994065
%N A095664 Ninth column (m=8) of (1,3)-Pascal triangle A095660.
%C A095664 If Y is a 3-subset of an n-set X then, for n>=10, a(n-10) is the number of 8-subsets of X having at most one element in common with Y. - _Milan Janjic_, Nov 23 2007
%F A095664 a(n)= binomial(n+7, 7)*(n+24)/8 = 3*b(n)-2*b(n-1), with b(n):=binomial(n+8, 8); cf. A000581.
%F A095664 G.f.: (3-2*x)/(1-x)^9.
%o A095664 (PARI) x='x+O('x^66); Vec((3-2*x)/(1-x)^9) \\ _Joerg Arndt_, May 11 2013
%Y A095664 Eighth column: A095663. Tenth column: A095665.
%K A095664 nonn,easy
%O A095664 0,1
%A A095664 _Wolfdieter Lang_, Jun 11 2004