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!)
A336728 a(0) = 1 and a(n) = (1/n) * Sum_{k=1..n} (-n)^(n-k) * binomial(n,k) * binomial(n,k-1) for n > 0. 2

%I #20 Aug 03 2020 08:52:33

%S 1,1,-1,1,9,-174,2575,-38219,588833,-9274418,141253551,-1739881142,

%T -753419447,1379742127908,-83720072007585,4059017293956301,

%U -184613801568558975,8254420480122200214,-369177108304219471457,16608406418618863804990,-750673988803431836351799

%N a(0) = 1 and a(n) = (1/n) * Sum_{k=1..n} (-n)^(n-k) * binomial(n,k) * binomial(n,k-1) for n > 0.

%H Seiichi Manyama, <a href="/A336728/b336728.txt">Table of n, a(n) for n = 0..387</a>

%F a(n) = Sum_{k=0..n} (-n)^k * (n+1)^(n-k) * binomial(n,k) * binomial(n+k,n)/(k+1).

%t a[0] = 1; a[n_] := Sum[(-n)^(n - k) * Binomial[n, k] * Binomial[n , k - 1], {k, 1, n}] / n; Array[a, 21, 0] (* _Amiram Eldar_, Aug 02 2020 *)

%o (PARI) {a(n) = if(n==0, 1, sum(k=1, n, (-n)^(n-k)*binomial(n, k)*binomial(n, k-1))/n)}

%o (PARI) {a(n) = sum(k=0, n, (-n)^k*(n+1)^(n-k)*binomial(n, k)*binomial(n+k, n)/(k+1))}

%Y Main diagonal of A336727.

%Y Cf. A242369, A307885, A336713, A336714.

%K sign

%O 0,5

%A _Seiichi Manyama_, Aug 02 2020

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 August 14 08:37 EDT 2024. Contains 375159 sequences. (Running on oeis4.)