On 2-adic orders of Stirling numbers of the second kind.
Page 1
Displaying 1 – 16 of 16
On a class of combinatorial sums involving generalized factorials.
Chou, W.-S., Hsu, L.C., Shiue, P.J.-S. (2007)
International Journal of Mathematics and Mathematical Sciences
On a generalization of an approximation operator defined by A. Lupaş.
Abel, Ulrich, Ivan, Mircea (2007)
General Mathematics
On a generalized recurrence for Bell numbers.
Katriel, Jacob (2008)
Journal of Integer Sequences [electronic only]
On a new family of generalized Stirling and Bell numbers.
Mansour, Toufik, Schork, Matthias, Shattuck, Mark (2011)
The Electronic Journal of Combinatorics [electronic only]
On a relation between the Riemann zeta function and the Stirling numbers.
Sato, Hirotaka (2008)
Integers
On generalizations of the Stirling number triangles.
Lang, Wolfdieter (2000)
Journal of Integer Sequences [electronic only]
On partitions, surjections, and Stirling numbers.
Hilton, Peter, Pedersen, Jean, Stigter, Jürgen (1994)
Bulletin of the Belgian Mathematical Society - Simon Stevin
On power series, Bell polynomials, Hardy-Ramanujan-Rademacher problem and its statistical applications
Vasily G. Voinov, Mikhail Nikulin (1994)
Kybernetika
On -Euler numbers related to the modified -Bernstein polynomials.
Kim, Min-Soo, Kim, Daeyeoul, Kim, Taekyun (2010)
Abstract and Applied Analysis
On some arithmetic properties of polynomial expressions involving Stirling numbers of the second kind
Martin Klazar, Florian Luca (2003)
Acta Arithmetica
On the coefficients of the asymptotic expansion of .
Nemes, Gergő (2010)
Journal of Integer Sequences [electronic only]
On the density of languages representing finite set partitions.
Moreira, Nelma, Reis, Rogério (2005)
Journal of Integer Sequences [electronic only]
On the power values of Stirling numbers
B. Brindza, Á. Pintér (1991)
Acta Arithmetica
On the problem of uniqueness for the maximum Stirling number(s) of the second kind.
Canfield, E.Rodney, Pomerance, Carl (2002)
Integers
On the sum of digits of some sequences of integers
Javier Cilleruelo, Florian Luca, Juanjo Rué, Ana Zumalacárregui (2013)
Open Mathematics
Let b ≥ 2 be a fixed positive integer. We show for a wide variety of sequences {a n}n=1∞ that for almost all n the sum of digits of a n in base b is at least c b log n, where c b is a constant depending on b and on the sequence. Our approach covers several integer sequences arising from number theory and combinatorics.
Currently displaying 1 – 16 of 16
Page 1