scispace - formally typeset
Search or ask a question
Journal ArticleDOI

Prime and prime power divisibility of Catalan numbers

01 Nov 1973-Journal of Combinatorial Theory, Series A (Academic Press)-Vol. 15, Iss: 3, pp 243-256
TL;DR: For any prime p, the sequence of Catalan numbers a n = 1 n 2n−2 n−1 is divided by the an prime to p into blocks Bk(k > 0) of an divisible by p, whose lengths and positions are determined.
About: This article is published in Journal of Combinatorial Theory, Series A.The article was published on 1973-11-01 and is currently open access. It has received 52 citations till now. The article focuses on the topics: Prime k-tuple & Almost prime.
Citations
More filters
Journal ArticleDOI
TL;DR: This paper proved various congruences for Catalan and Motzkin numbers as well as related sequences in terms of binomial coefficients, and showed that all these sequences can be expressed as binomial numbers.

107 citations


Cites background or methods from "Prime and prime power divisibility ..."

  • ...Note that not only have we been able to determine the length and starting and ending points of the block (which was also done by Alter and Kubota) but our demonstration is combinatorial as opposed to the original proof of Theorem 5.1 which is arithmetic....

    [...]

  • ...Alter and Kubota [4] have generalized this result to arbitrary primes and prime powers....

    [...]

  • ...The divisibility of the Catalan numbers Cn = 1 n + 1 ( 2n n ) , n ∈ N, by primes and prime powers has been completely determined by Alter and Kubota [4] using arithmetic techniques....

    [...]

  • ..., n ∈ N, by primes and prime powers has been completely determined by Alter and Kubota [4] using arithmetic techniques....

    [...]

  • ...Theorem 5.1 (Alter and Kubota) Let p ≥ 3 be a prime and let q = (p + 1)/2....

    [...]

Journal ArticleDOI
TL;DR: In this article, the authors used the framework of automatic sequences to study combinatorial sequences modulo prime powers, and provided a method, based on work of Denef and Lipshitz, for computing a finite automaton for the sequence modulo pα, for all but finitely many primes p.
Abstract: In this paper we use the framework of automatic sequences to study combinatorial sequences modulo prime powers. Given a sequence whose generating function is the diagonal of a rational power series, we provide a method, based on work of Denef and Lipshitz, for computing a finite automaton for the sequence modulo pα, for all but finitely many primes p. This method gives completely automatic proofs of known results, establishes a number of new theorems for well-known sequences, and allows us to resolve some conjectures regarding the Apery numbers. We also give a second method, which applies to an algebraic sequence modulo pα for all primes p, but is significantly slower. Finally, we show that a broad range of multidimensional sequences possess Lucas products modulo p.

49 citations

Journal ArticleDOI
TL;DR: This paper proves the conjecture proposed by Deutsch and Sagan that no Motzkin number is a multiple of 8, and compute the congruences of Catalan andMotzkin numbers modulo 4 and 8.
Abstract: In this paper, we compute the congruences of Catalan and Motzkin numbers modulo 4 and 8. In particular, we prove the conjecture proposed by Deutsch and Sagan that no Motzkin number is a multiple of 8.

39 citations


Cites background from "Prime and prime power divisibility ..."

  • ...On the other hand, the studies on the congruences of the Motzkin numbers Mn are few and were energized very recently....

    [...]

  • ...There are many ways to define Mn , but in order to calculate the congruences, we choose the above definition....

    [...]

Journal ArticleDOI
TL;DR: In this article, a generalization of a conjecture of Dokos, Dwyer, Johnson, Sagan, and Selsor gave a recursion for the inversion polynomial of 321-avoiding permutations.

32 citations

Victor H. Moll1
01 Jan 2007
TL;DR: In this paper, the authors present analytical properties of a sequence of integers related to the evaluation of a rational integral and present an algorithm for the 2-adic valuation of these integers that has a combinatorial interpretation.
Abstract: We present analytical properties of a sequence of integers related to the evaluation of a rational integral. We also discuss an algorithm for the evaluation of the 2-adic valuation of these integers that has a combinatorial interpretation.

31 citations


Cites background from "Prime and prime power divisibility ..."

  • ...The reader will find in [1] information about the prime decomposition of Catalan numbers and [21] describes divisibility by 2 of the Stirling numbers of second kind....

    [...]

References
More filters
Journal ArticleDOI
TL;DR: Brown as mentioned in this paper presented a historical note on a recurrent combinatorial problem, The American Mathematical Monthly, 72:9, 973-977, DOI: 10.1080/00029890.1965.
Abstract: ISSN: 0002-9890 (Print) 1930-0972 (Online) Journal homepage: https://www.tandfonline.com/loi/uamm20 Historical Note on a Recurrent Combinatorial Problem William G. Brown To cite this article: William G. Brown (1965) Historical Note on a Recurrent Combinatorial Problem, The American Mathematical Monthly, 72:9, 973-977, DOI: 10.1080/00029890.1965.11970654 To link to this article: https://doi.org/10.1080/00029890.1965.11970654

43 citations