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!)
A182525 a(n) = n! * Sum_{k=0..n} binomial(2*n, 2*k) / binomial(n,k). 1
1, 2, 10, 72, 664, 7440, 98064, 1486464, 25476480, 487192320, 10284768000, 237574149120, 5960907832320, 161440734873600, 4694193123379200, 145855192928256000, 4822943651308339200, 169104439543534387200, 6266811206473703424000 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
Sela Fried and Toufik Mansour, Graph labelings obtainable by random walks, arXiv:2304.05728 [math.CO], 2023.
FORMULA
Asymptotic: a(n) ~ Pi*n^(n+1)*2^(n-1/2)/exp(n). [Vaclav Kotesovec, May 06 2012]
E.g.f.: ( x * arctan(x / sqrt(1 - 2*x)) + sqrt(1 - 2*x) ) / (sqrt(1 - 2*x))^3. -Sela Fried, Apr 26 2023
EXAMPLE
E.g.f.: A(x) = 1 + 2*x + 10*x^2/2! + 72*x^3/3! + 664*x^4/4! + 7440*x^5/5! +...
a(1) = 1!*(1/1 + 1/1) = 2;
a(2) = 2!*(1/1 + 6/2 + 1/1) = 10;
a(3) = 3!*(1/1 + 15/3 + 15/3 + 1/1) = 72;
a(4) = 4!*(1/1 + 28/4 + 70/6 + 28/4 + 1/1) = 664;
a(5) = 5!*(1/1 + 45/5 + 210/10 + 210/10 + 45/5 + 1/1) = 7440; ...
MATHEMATICA
RecurrenceTable[{a[n]==3*n*a[n-1]-n*(2n-3)*a[n-2], a[0]==1, a[1]==2}, a, {n, 0, 25}] (* Vaclav Kotesovec, May 06 2012 *)
PROG
(PARI) {a(n)=n!*sum(k=0, n, binomial(2*n, 2*k)/binomial(n, k))}
CROSSREFS
Sequence in context: A111554 A177384 A354288 * A321389 A292406 A185183
KEYWORD
nonn
AUTHOR
Paul D. Hanna, May 03 2012
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 September 4 08:50 EDT 2024. Contains 375679 sequences. (Running on oeis4.)