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!)
Search: seq:1,0,2,6,36,240,1200,12600,58800,846720
Displaying 1-1 of 1 result found. page 1
     Sort: relevance | references | number | modified | created      Format: long | short | data
A343581 a(n) = binomial(n, floor(n/2))*FallingFactorial(n - 1, n - floor(n/2)). +30
0
1, 0, 2, 6, 36, 240, 1200, 12600, 58800, 846720, 3810240, 69854400, 307359360, 6849722880, 29682132480, 779155977600, 3339239904000, 100919250432000, 428906814336000, 14668613050291200, 61934143990118400, 2364758225077248000, 9931984545324441600, 418798681661180620800 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
Partially ordered sets on n elements that consist entirely of floor(n/2) chains (nonempty, linearly ordered subsets).
LINKS
FORMULA
a(n) = Sum_{j=floor(n/2)..n} |Stirling1(n, j)|*Stirling2(j, floor(n/2)).
a(n) = binomial(n - 1, floor(n/2) - 1)*n!/floor(n/2)!) for n >= 1, a(0) = 1.
a(n) = A271703(n, floor(n/2)).
MAPLE
a := n -> `if`(n=0, 1, binomial(n - 1, iquo(n, 2) - 1)*n!/iquo(n, 2)!):
seq(a(n), n = 0..21);
PROG
(SageMath)
def a(n): return binomial(n, n - n//2)*falling_factorial(n - 1, n - n//2)
print([a(n) for n in range(22)])
(PARI) a(n) = sum(j=n\2, n, abs(stirling(n, j, 1))*stirling(j, n\2, 2)); \\ Michel Marcus, Apr 22 2021
CROSSREFS
KEYWORD
nonn
AUTHOR
Peter Luschny, Apr 21 2021
STATUS
approved
page 1

Search completed in 0.002 seconds

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 29 14:02 EDT 2024. Contains 373851 sequences. (Running on oeis4.)