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!)
A025134 a(n) = n-th elementary symmetric function of C(n,0), C(n,1), ..., C(n,n). 3

%I #11 Sep 08 2019 13:50:27

%S 1,2,5,24,256,6500,407700,64538880,26120421376,27252226455552,

%T 73710997920000000,519006451497395400000,9544405721673726148608000,

%U 459675814976476432499714440320,58118199039973755223479833897882880,19330456644008414104033256172750000000000

%N a(n) = n-th elementary symmetric function of C(n,0), C(n,1), ..., C(n,n).

%H Andrew Howroyd, <a href="/A025134/b025134.txt">Table of n, a(n) for n = 0..50</a>

%p a:= n-> coeff(mul(binomial(n, i)*x+1, i=0..n), x, n):

%p seq(a(n), n=0..20); # _Alois P. Heinz_, Sep 08 2019

%t ESym[u_] := Module[{v, t}, v = Table[0, {Length[u]+1}]; v[[1]] = 1; For[i = 1, i <= Length[u], i++, t = u[[i]]; For[j = i, j >= 1, j--, v[[j+1]] += v[[j]]*t]]; v];

%t a[n_] := ESym[Table[Binomial[n, k], {k, 0, n}]][[n+1]];

%t a /@ Range[0, 15] (* _Jean-François Alcover_, Sep 08 2019, from PARI *)

%o (PARI)

%o ESym(u)={my(v=vector(#u+1)); v[1]=1; for(i=1, #u, my(t=u[i]); forstep(j=i, 1,-1, v[j+1]+=v[j]*t)); v}

%o a(n)={ESym(binomial(n))[n+1]} \\ _Andrew Howroyd_, Dec 19 2018

%K nonn

%O 0,2

%A _Clark Kimberling_

%E Terms a(10) and beyond from _Andrew Howroyd_, Dec 19 2018

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 19 14:10 EDT 2024. Contains 371792 sequences. (Running on oeis4.)