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

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

%I

%S 330,6336,61776,411840,2123550,9060480,33372768,109219968,324246780,

%T 886828800,2261413440,5427392256,12352970916,26829982080,55895796000,

%U 112183843200,217706770710,409800980160,750266946000,1339149240000,2335141487250,3985308138240

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

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

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

%e a(7): C(7+7,7)*C(7+11,7) = C(14,7)*C(18,7) = 3432*31824 = 109219968.

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

%o (PARI) vector(30, n, n--; binomial(n+7,7)*binomial(n+11,7)) \\ _Michel Marcus_, Jul 31 2015

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

%o (Python)

%o A104476_list, m = [], [3432, -1716, 660, 330, 330, 330, 330, 330, 330, 330, 330, 330, 330, 330, 330]

%o for _ in range(10**2):

%o A104476_list.append(m[-1])

%o for i in range(14):

%o m[i+1] += m[i] # _Chai Wah Wu_, Dec 15 2015

%K easy,nonn

%O 0,1

%A _Zerinvary Lajos_, Apr 18 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.

Last modified May 26 02:56 EDT 2020. Contains 334613 sequences. (Running on oeis4.)