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!)
A358397 Number of pairs of partitions (A<=B, that is, A is a refinement of B) of [n] such that A is noncrossing and its nontrivial blocks are of type {a,b} with a <= n and b > n. 0

%I #7 Dec 21 2022 21:47:18

%S 1,1,3,9,37,157,811,4309,26327,164947,1151477,8224863,64158567,

%T 511177515,4386520201,38389960685,358214414675,3404632390971,

%U 34234771676473,350261221644771,3768281045014927,41210302324325919,471585931164213345,5480984322433817771,66388136273738685321

%N Number of pairs of partitions (A<=B, that is, A is a refinement of B) of [n] such that A is noncrossing and its nontrivial blocks are of type {a,b} with a <= n and b > n.

%F a(n) = Sum_{k=0..m} binomial(m,k)*binomial(m+e,k)*Bell(n-k), with m = floor(n/2), e = n mod 2 and where Bell(n) is the Bell exponential number A000110(n).

%Y Cf. A000110.

%K nonn

%O 0,3

%A _Francesca Aicardi_, Nov 13 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 June 4 17:49 EDT 2024. Contains 373102 sequences. (Running on oeis4.)