Number of binomial coefficients divisible by a fixed power of a prime.

Everett, William B.

Displaying similar documents to “Number of binomial coefficients divisible by a fixed power of a prime.”

A combinatorial interpretation of the poly-Bernoulli numbers and two Fermat analogues.

Brewbaker, Chad (2008)

Integers

Similarity:

$n$ -words over any alphabet with forbidden any 3-subwords.

Doroslovački, Rade, Marković, Olivera (2000)

Novi Sad Journal of Mathematics

Similarity:

A divisibility property of binomial coefficients viewed as an elementary sieve.

Hudson, Richard H., Williams, Kenneth S. (1981)

International Journal of Mathematics and Mathematical Sciences

Similarity:

$n$ -words over any alphabet without subword $a \underset{k - 1}{\underset{︸}{b \dots b}} a$ for fixed $a$ , $b$ and $k$ .

Doroslovački, Rade, Marković, Olivera (2000)

Novi Sad Journal of Mathematics

Similarity:

On Christoffel classes

Jean-Pierre Borel, Christophe Reutenauer (2006)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

We characterize conjugation classes of Christoffel words (equivalently of standard words) by the number of factors. We give several geometric proofs of classical results on these words and sturmian words.

Two very short proofs of combinatorial identity.

Anglani, Roberto, Barile, Margherita (2005)

Integers

Similarity:

Standard factors of Sturmian words

Gwénaël Richomme, Kalle Saari, Luca Q. Zamboni (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

Among the various ways to construct a characteristic Sturmian word, one of the most used consists in defining an infinite sequence of prefixes that are standard. Nevertheless in any characteristic word , some standard words occur that are not prefixes of . We characterize all standard words occurring in any characteristic word (and so in any Sturmian word) using firstly morphisms, then standard prefixes and finally palindromes.

Binomial coefficient predictors.

Shevelev, Vladimir (2011)

Journal of Integer Sequences [electronic only]

Similarity:

There exist binary circular $5 / 2^{+}$ power free words of every length.

Aberkane, Ali, Currie, James D. (2004)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Bordered conjugates of words over large alphabets.

Harju, Tero, Nowotka, Dirk (2008)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Binary $n$ -words without the subword 1010. . . 10.

Doroslovački, Rade, Marković, Olivera (1998)

Novi Sad Journal of Mathematics

Similarity:

Floor and roof function analogs of the Bell numbers.

Gould, H.W., Quaintance, Jocelyn (2007)

Integers

Similarity:

How to build billiard words using decimations

Jean-Pierre Borel (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

We present two methods based on decimation for computing finite billiard words on any finite alphabet. The first method computes finite billiard words by iteration of some transformation on words. The number of iterations is explicitly bounded. The second one gives a direct formula for the billiard words. Some results remain true for infinite standard Sturmian words, but cannot be used for computation as they only are limit results.