scispace - formally typeset
Open AccessJournal ArticleDOI

Prime and prime power divisibility of Catalan numbers

Ronald Alter, +1 more
- 01 Nov 1973 - 
- Vol. 15, Iss: 3, pp 243-256
Reads0
Chats0
TLDR
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.

read more

Citations
More filters
Proceedings ArticleDOI

Social network analysis of the global game jam network

TL;DR: The results indicate that jammers are most likely to work on teams between two and five members and often work together with the same colleagues, and while the game jam is a highly international event, jammers barely change their geographical locations.
Posted Content

The odd Catalan numbers modulo 2^k

TL;DR: In this paper, it was shown that there exist only k - 1 different congruences of the odd Catalan numbers modulo 2^k for m = 1, 2,..., k- 1.
Journal Article

ODD CATALAN NUMBERS MODULO 2 k

Hsueh-Yung Lin
- 01 Jan 2011 - 
TL;DR: In this paper, Liu and Yeh proved a conjecture by S.-C. Liu and C. Yeh that odd Catalan numbers can take exactly the same number of rounds as normal numbers.
Posted Content

A combinatorial approach to the power of 2 in the number of involutions

TL;DR: In this paper, the authors provided a combinatorial approach to the largest power of $p$ in the number of permutations for a fixed prime number, where p = 1.
Posted Content

On polynomial recursive sequences

TL;DR: This work studies the expressive power of polynomial recursive sequences, a nonlinear extension of the well-known class of linear recursive sequences.
References
More filters
Journal ArticleDOI

Historical Note on a Recurrent Combinatorial Problem

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.