The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A054133 T(2n-1,n) where T is the array in A054126. 0

%I #15 May 30 2022 08:24:51

%S 2,7,39,236,1479,9418,60492,390720,2534115,16489802,107594725,

%T 703681448,4611414244,30273029080,199045400424

%N T(2n-1,n) where T is the array in A054126.

%F a(n) = A052509(4*n-2,3*n) + A052509(4*n-2,n-1) = 2^(n-2) + Sum_{m=0..n-1} binomial(3*n-1,m) for n >= 2. - _Jianing Song_, May 30 2022

%o (PARI) a(n) = if(n==1, 2, 2^(n-2) + sum(m=0, n-1, binomial(3*n-1, m))) \\ _Jianing Song_, May 30 2022

%Y Cf. A054126.

%K nonn,more

%O 1,1

%A _Clark Kimberling_

%E Definition clarified by _Eric Rowland_, May 29 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 May 15 14:28 EDT 2024. Contains 372540 sequences. (Running on oeis4.)