login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A323534 a(n) = Product_{k=1..n} (binomial(k-1,6) + binomial(n-k,6)). 7

%I #13 Feb 01 2019 21:22:17

%S 1,0,0,0,0,0,0,0,0,0,0,0,2551486386077798400,

%T 4356795681519916813516800,8378295212644383454317143654400,

%U 17729411415388061815791372479702630400,47314452412112353657024080317791118400000000,160496342476959706163534573940481304027441961369600

%N a(n) = Product_{k=1..n} (binomial(k-1,6) + binomial(n-k,6)).

%H Robert Israel, <a href="/A323534/b323534.txt">Table of n, a(n) for n = 0..115</a>

%F a(n) ~ exp(-6*n + (15 - 4*sqrt(3))*Pi*(n-6)/6) * n^(6*n) / (6!)^n.

%p f:= proc(n) local k; mul(binomial(k-1,6)+binomial(n-k,6),k=1..n) end proc:

%p map(f, [$0..20]); # _Robert Israel_, Feb 01 2019

%t Table[Product[Binomial[k-1,6] + Binomial[n-k,6], {k, 1, n}], {n, 0, 20}]

%o (PARI) a(n) = prod(k=1, n, binomial(k-1, 6) + binomial(n-k, 6)); \\ _Daniel Suteu_, Jan 17 2019

%Y Cf. A000579, A323425, A323496, A323497, A323533, A323535.

%K nonn

%O 0,13

%A _Vaclav Kotesovec_, Jan 17 2019

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 11:49 EDT 2024. Contains 371936 sequences. (Running on oeis4.)