This site is supported by donations to The OEIS Foundation.

Sorting numbers

From OeisWiki
Jump to navigationJump to search

The purpose of this page is to clarify the definitions and notation used by Motzkin in "Sorting numbers for cylinders and other classification numbers" (1971).

Sequence Notation Correspondence

Sequences of "Sorting Numbers" in the OEIS
Sequence Motzkin's Notation
Partition numbers A000041(n)=!!n
Bell numbers A000110(n)=!n
Number of partitions of {1,...,n} A000262(n)=!n+
Fubini numbers A000670(n)=Σ>n
E.g.f.: e^(2*(e^x - 1)) A001861(n)=!!_n
Max_{k} { Number of partitions of n into k positive parts } A002569(n)=!max>!n
n!*2^(n-1) A002866(n)=Σ>n+
(n+1)!*binomial(n,floor(n/2)) A002867(n1)=max>n+
Largest number in n-th row of triangle A008297 A002868(n)=!max>n+
Largest number in n-th row of triangle A019538 A002869(n)=max>n
Max_{k} Stirling2(n,k) A002870(n)=!max>n
Max_{k} 2^k*Stirling2(n,k) A002871(n)=!max>!_n
Column 2 of A162663 A002872(n)=!!_2n=!cy_2n
Max_{k} #{partitions of 2n into k parts
which are invariant under (12)(34)...(2n-1,2n)}
A002873(n)=!max>!_2n
Column 3 of A162663 A002874(n)=!cy_3n
Max_{k} #{partitions of 3n which are invariant as a whole
under a permutation consisting of n 3-cycles
and have k orbits of parts}
A002875(n)=!max>cy_3n
Stirling numbers of the second kind A008277(n,k)=!k>n
Falling factorial A008279(n,k)=n<k
Number of partitions of n into k positive parts A008284(n,k)=!k>!n
k!*Stirling2(n,k) A019538(n,k)=k>n
Number of partitions of n into at most k positive parts A026820(n,k)=!k!n
Column 5 of A162663 A036075(n)=!cy_5n
Column 7 of A162663 A036077(n)=!cy_7n
Column 11 of A162663 A036081(n)=!cy_11n
Sum_{i<=k} Stirling2(n,i) A102661(n,k)=!kn
Column 13 of A162663 A141009(n)=!cy_13n
n!*binomial(n-1,k-1) A156992(n,k)=k>n+


See also

References