login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A105250 a(n) = binomial(n+3,n)*binomial(n+7,n). 1

%I

%S 1,32,360,2400,11550,44352,144144,411840,1061775,2516800,5562128,

%T 11583936,22926540,43411200,79070400,139163904,237557133,394558560,

%U 639331000,1013012000,1572701130,2396496960,3589794000,5293080000,7691506875,11026544256,15610063392

%N a(n) = binomial(n+3,n)*binomial(n+7,n).

%H T. D. Noe, <a href="/A105250/b105250.txt">Table of n, a(n) for n = 0..1000</a>

%H <a href="/index/Rec#order_11">Index entries for linear recurrences with constant coefficients</a>, signature (11,-55,165,-330,462,-462,330,-165,55,-11,1).

%F G.f.: -(35*x^3+63*x^2+21*x+1)/(x-1)^11. [_Colin Barker_, Jan 21 2013]

%e a(0): C(0+3,0)*C(0+7,0) = C(3,0)*C(7,0) = 1*1 = 1;

%e a(10): C(10+3,10)*C(10+7,10) = C(13,10)*(17,10) = 286*19448 = 5562128.

%t f[n_] := Binomial[n + 3, n]Binomial[n + 7, n]; Table[ f[n], {n, 0, 23}] (* _Robert G. Wilson v_, Apr 20 2005 *)

%o (MAGMA) [Binomial(n+3,n)*Binomial(n+7,n): n in [0..30]]; // _Vincenzo Librandi_, Jul 31 2015

%Y Cf. A062264.

%K easy,nonn

%O 0,2

%A _Zerinvary Lajos_, Apr 14 2005

%E More terms from _Robert G. Wilson v_, Apr 20 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 6 18:59 EDT 2020. Contains 334832 sequences. (Running on oeis4.)