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!)
A343581 a(n) = binomial(n, floor(n/2))*FallingFactorial(n - 1, n - floor(n/2)). 0

%I #7 Apr 22 2021 07:02:19

%S 1,0,2,6,36,240,1200,12600,58800,846720,3810240,69854400,307359360,

%T 6849722880,29682132480,779155977600,3339239904000,100919250432000,

%U 428906814336000,14668613050291200,61934143990118400,2364758225077248000,9931984545324441600,418798681661180620800

%N a(n) = binomial(n, floor(n/2))*FallingFactorial(n - 1, n - floor(n/2)).

%C Partially ordered sets on n elements that consist entirely of floor(n/2) chains (nonempty, linearly ordered subsets).

%F a(n) = Sum_{j=floor(n/2)..n} |Stirling1(n, j)|*Stirling2(j, floor(n/2)).

%F a(n) = binomial(n - 1, floor(n/2) - 1)*n!/floor(n/2)!) for n >= 1, a(0) = 1.

%F a(n) = A271703(n, floor(n/2)).

%p a := n -> `if`(n=0, 1, binomial(n - 1, iquo(n,2) - 1)*n!/iquo(n, 2)!):

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

%o (SageMath)

%o def a(n): return binomial(n, n - n//2)*falling_factorial(n - 1, n - n//2)

%o print([a(n) for n in range(22)])

%o (PARI) a(n) = sum(j=n\2, n, abs(stirling(n, j, 1))*stirling(j, n\2, 2)); \\ _Michel Marcus_, Apr 22 2021

%Y Cf. A187535, A271703.

%K nonn

%O 0,3

%A _Peter Luschny_, Apr 21 2021

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