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
1, 1, -1, 1, 9, -174, 2575, -38219, 588833, -9274418, 141253551, -1739881142, -753419447, 1379742127908, -83720072007585, 4059017293956301, -184613801568558975, 8254420480122200214, -369177108304219471457, 16608406418618863804990, -750673988803431836351799 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,5
LINKS
FORMULA
a(n) = Sum_{k=0..n} (-n)^k * (n+1)^(n-k) * binomial(n,k) * binomial(n+k,n)/(k+1).
MATHEMATICA
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 *)
PROG
(PARI) {a(n) = if(n==0, 1, sum(k=1, n, (-n)^(n-k)*binomial(n, k)*binomial(n, k-1))/n)}
(PARI) {a(n) = sum(k=0, n, (-n)^k*(n+1)^(n-k)*binomial(n, k)*binomial(n+k, n)/(k+1))}
CROSSREFS
Main diagonal of A336727.
Sequence in context: A225813 A357348 A357345 * A305465 A027956 A003280
KEYWORD
sign
AUTHOR
Seiichi Manyama, Aug 02 2020
STATUS
approved

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 17 21:01 EDT 2024. Contains 371767 sequences. (Running on oeis4.)