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!)
A359108 a(n) = A128899(2*n, n) = 2*binomial(4*n - 1, 3*n) for n >= 1 and a(0) = 1. 1

%I #16 May 02 2023 07:49:17

%S 1,2,14,110,910,7752,67298,592020,5259150,47071640,423830264,

%T 3834669566,34834267234,317506779800,2902365981900,26597044596360,

%U 244263468539790,2247575790712824,20716044882791720,191230475831922200,1767658071106087160,16359617358545329440

%N a(n) = A128899(2*n, n) = 2*binomial(4*n - 1, 3*n) for n >= 1 and a(0) = 1.

%F a(n) = (8*(2*n - 1) * (4*n - 3) * (4*n - 1) * a(n - 1)) / (3*n * (3*n - 2) * (3*n - 1))) for n >= 2.

%F a(n) = (1/2)*A005810(n) = 2*A224274(n) for n >= 1. - _Peter Bala_, Feb 08 2023

%F a(n) = [x^(2*n)] C(x^2)^(2*n), where C(x) = (1 - sqrt(1 - 4*x))/(2*x) is the g.f. of the Catalan numbers A000108. - _Peter Bala_, Apr 27 2023

%p a := n -> ifelse(n = 0, 1, 2*binomial(4*n - 1, 3*n)):

%p # Alternative:

%p a := proc(n) option remember; ifelse(n < 2, n + 1, (8*(2*n - 1) * (4*n - 3) * (4*n - 1) * a(n - 1)) / (3 * n * (3*n - 2) * (3*n - 1))) end:

%p seq(a(n), n = 0..19);

%Y Cf. A005810, A128899, A224274.

%K nonn,easy

%O 0,2

%A _Peter Luschny_, Dec 27 2022

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 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)