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!)
A238452 Second column of the extended Catalan triangle A189231. 2

%I #19 Jun 07 2021 13:31:19

%S 0,1,2,2,8,5,30,14,112,42,420,132,1584,429,6006,1430,22880,4862,87516,

%T 16796,335920,58786,1293292,208012,4992288,742900,19315400,2674440,

%U 74884320,9694845,290845350,35357670,1131445440,129644790,4407922860,477638700,17194993200

%N Second column of the extended Catalan triangle A189231.

%F Definition: a(n) = binomial(n+1, floor(n/2)+1) / (floor(n/2)+2) if n is odd, and 2*binomial(n, floor(n/2)+1) otherwise.

%F a(n) = A189231(n, 1).

%F a(n) = A238762(n+1, n-1).

%F a(2*n) = A162551(n).

%F a(2*n+1) = A000108(n+1).

%F a(n) = A057977(n+1) - A057977(n)*((n+1) mod 2). - _Peter Luschny_, Aug 07 2016

%p a := proc(n) option remember;

%p if n < 3 then return n fi;

%p if n mod 2 = 0 then return n*a(n-1) fi;

%p h := iquo(n,2); n*a(n-1)/(h*(h+2)) end:

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

%t t[n_, k_] /; (k > n || k < 0) = 0; t[n_, n_] = 1; t[n_, k_] := t[n, k] =

%t t[n - 1, k - 1] + Mod[n - k, 2] t[n - 1, k] + t[n - 1, k + 1];

%t a[n_] := t[n, 1];

%t Table[a[n], {n, 0, 36}] (* _Jean-François Alcover_, Jul 10 2019 *)

%o (Sage)

%o def A238452():

%o a = 1; n = 2

%o yield 0

%o while True:

%o yield a

%o a *= n

%o if is_odd(n):

%o a /= (n//2*(n//2+2))

%o n += 1

%o a = A238452(); [next(a) for n in range(36)]

%Y Cf. A000108, A057977, A162551, A189231.

%K nonn,easy

%O 0,3

%A _Peter Luschny_, Mar 01 2014

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