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!)
A050147 a(n) = T(n,n-1), array T as in A050143. Also T(2n+1,n), array T as in A055807. 2
1, 3, 12, 56, 280, 1452, 7700, 41456, 225648, 1238420, 6840988, 37986984, 211842696, 1185635388, 6655993380, 37463920608, 211350457824, 1194706644516, 6765300359468, 38370431711000, 217931108199672 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
From Vladimir Kruchinin, Nov 25 2014: (Start)
G.f.: x*((-x^2 + 4*x + 1)/(2*sqrt(x^2 - 6*x + 1)) -x/2 + 1/2).
a(n) = C(2*n-3,n-2) + Sum(i=0..n-2} C(n,i+1)*C(n+i-2,n-2). (End)
a(n) ~ (1 + sqrt(2))^(2*n-2) / (2^(1/4) * sqrt(Pi*n)). - Vaclav Kotesovec, Feb 14 2021
a(n) = binomial(2*n-3, n-1)*hypergeom([-n+1, -n], [-2*n+3], -1). - Detlef Meya, Dec 04 2023
MATHEMATICA
a[n_]:=Binomial[2*n-3, n-1]*Hypergeometric2F1[-n+1, -n, -2*n+3, -1];
Table[a[n], {n, 1, 21}] (* Detlef Meya, Dec 04 2023 *)
PROG
(Maxima) a(n):=if n=1 then 1 else sum((binomial(n, i+1))*binomial(n+i-2, n-2), i, 0, n-2)+binomial(2*n-3, n-2); /* Vladimir Kruchinin, Nov 25 2014 */
CROSSREFS
Sequence in context: A284843 A107318 A176281 * A259800 A350482 A120921
KEYWORD
nonn
AUTHOR
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 24 13:58 EDT 2024. Contains 371960 sequences. (Running on oeis4.)