EuDML | Browse

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Subjects
11-XX Number theory
11Bxx Sequences and sets
11B65 Binomial coefficients; factorials; $q$ -identities

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1

Displaying 1 – 4 of 4

Bijective proofs of parity theorems for partition statistics.

Shattuck, Mark (2005)

Journal of Integer Sequences [electronic only]

Binomial coefficient predictors.

Shevelev, Vladimir (2011)

Journal of Integer Sequences [electronic only]

Bounds for the counting function of the Jordan-Pólya numbers

Jean-Marie De Koninck, Nicolas Doyon, A. Arthur Bonkli Razafindrasoanaivolala, William Verreault (2020)

Archivum Mathematicum

A positive integer $n$ is said to be a Jordan-Pólya number if it can be written as a product of factorials. We obtain non-trivial lower and upper bounds for the number of Jordan-Pólya numbers not exceeding a given number $x$ .

Brownian motion and the generalized Catalan numbers.

Abate, Joseph, Whitt, Ward (2011)

Journal of Integer Sequences [electronic only]

Currently displaying 1 – 4 of 4

Page 1