cp's OEIS Frontend

A055799 T(2n+6,n), array T as in A055794.

%I A055799 #29 Sep 08 2022 08:45:01
%S A055799 1,8,37,130,385,1012,2431,5434,11440,22880,43758,80444,142766,245480,
%T A055799 410210,667964,1062347,1653608,2523675,3782350,5574855,8090940,
%U A055799 11575785,16342950,22789650,31414656,42839148,57830872
%N A055799 T(2n+6,n), array T as in A055794.
%C A055799 If Y is a 2-subset of an n-set X then, for n>=9, a(n-9) is the number of 9-subsets of X which do not have exactly one element in common with Y. - _Milan Janjic_, Dec 28 2007
%H A055799 Vincenzo Librandi, <a href="/A055799/b055799.txt">Table of n, a(n) for n = 0..1000</a>
%H A055799 <a href="/index/Rec#order_10">Index entries for linear recurrences with constant coefficients</a>, signature (10,-45,120,-210,252,-210,120,-45,10,-1).
%F A055799 a(n-9) = binomial(n,9) - 2*binomial(n-2,8), n=9, 10, ... . - _Milan Janjic_, Dec 28 2007
%F A055799 G.f.: (1-2*x+2*x^2)/(1-x)^10. - _Colin Barker_, Feb 21 2012
%F A055799 a(n) = 10*a(n-1) - 45*a(n-2) + 120*a(n-3) - 210*a(n-4)+ 252*a(n-5) - 210*a(n-6) + 120*a(n-7) - 45*a(n-8) + 10*a(n-9) - a(n-10). - _Vincenzo Librandi_, May 01 2012
%t A055799 a=1;b=2;c=3;d=4;e=5;f=6;g=7;s=8;lst={1,s};Do[a+=n;b+=a;c+=b;d+=c;e+=d;f+=e;g+=f;s+=g;AppendTo[lst,s],{n,6!}];lst (* _Vladimir Joseph Stephan Orlovsky_, May 24 2009 *)
%t A055799 CoefficientList[Series[(1-2*x+2*x^2)/(1-x)^10,{x,0,30}],x] (* _Vincenzo Librandi_, May 01 2012 *)
%o A055799 (Magma) [Binomial(n,9)-2*Binomial(n-2,8):n in [9..40]]; // _Vincenzo Librandi_, May 01 2012
%Y A055799 Cf. A051601.
%K A055799 nonn,easy
%O A055799 0,2
%A A055799 _Clark Kimberling_, May 28 2000