login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A197209
Row sums of A197208.
2
3, 24, 180, 1320, 9660, 70896, 522648, 3871440, 28809990, 215318400, 1615579680, 12165491520, 91905439080, 696359055840, 5290416835440, 40291036122528, 307537305284574, 2352216447006480, 18024996856976760
OFFSET
2,1
LINKS
FORMULA
For n >= 2, a(n) = Sum_{k = 1..n-1} C(n-1,k-1)*C(n,k+1)*C(n+1,k), where C(n,k) = binomial(n,k).
a(n) = (1/(n+2)) * ((7*n^2-7*n-2)*a(n-1)/(n-2) + 8*n*a(n-2)) for n > 3. - Seiichi Manyama, Jan 09 2021
MATHEMATICA
Table[Sum[Binomial[n-1, k-1]Binomial[n, k+1]Binomial[n+1, k], {k, n-1}], {n, 2, 20}] (* Harvey P. Dale, May 08 2016 *)
PROG
(PARI) a(n) = sum(k=1, n-1, binomial(n-1, k-1)*binomial(n, k+1)*binomial(n+1, k)); \\ Michel Marcus, Jan 09 2021
CROSSREFS
Sequence in context: A356361 A292293 A073985 * A317527 A181967 A144087
KEYWORD
nonn,easy
AUTHOR
Peter Bala, Oct 12 2011
STATUS
approved