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!)
A262407 a(n) = Sum_{k=0..n-1} C(n,k+1)*C(n,k)*C(n-1,k). 1
0, 1, 4, 24, 152, 1010, 6912, 48328, 343408, 2471274, 17966360, 131717960, 972488640, 7223061040, 53925450880, 404400203280, 3044645475296, 23002424245754, 174324246314184, 1324800580881952, 10093304926771600, 77073430602848316, 589761299099196224 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
FORMULA
a(n) = A000279(n)/(3*n) = (A000172(n)+4*A000172(n-1))*n/(3*(n+1)).
a(n) ~ 8^n/(sqrt(3)*Pi*n) as n -> oo.
MAPLE
a:= proc(n) option remember; `if`(n<2, n,
((21*n^3-49*n^2+30*n-8)*a(n-1)+
(8*(n-1))*(n-2)*(3*n-1)*a(n-2))/
((3*n-4)*(n+1)*(n-1)))
end:
seq(a(n), n=0..30); # Alois P. Heinz, Sep 22 2015
MATHEMATICA
f[n_]:=HypergeometricPFQ[{-n, -n, -n}, {1, 1}, -1]; a[n_]:=n^2 (f[n] + 4 f[n - 1])/(3 n^2 + 3 n); Array[a, 25] (* Vincenzo Librandi, Sep 22 2015 *)
Table[Sum[Binomial[n, k+1]Binomial[n, k]Binomial[n-1, k], {k, 0, n-1}], {n, 0, 30}] (* Harvey P. Dale, Apr 09 2021 *)
PROG
(PARI) a(n)=sum(k=0, n-1, binomial(n, k+1)*binomial(n, k)*binomial(n-1, k))
CROSSREFS
Sequence in context: A369327 A192806 A347915 * A192927 A003288 A178879
KEYWORD
nonn
AUTHOR
M. F. Hasler, Sep 21 2015
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 23 02:53 EDT 2024. Contains 371906 sequences. (Running on oeis4.)