Alter, Ronald; Kubota, K. K. Prime and prime power divisibility of Catalan numbers. (English) Zbl 0273.10010 J. Comb. Theory, Ser. A 15, 243-256 (1973). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 1 ReviewCited in 14 Documents MSC: 11B39 Fibonacci and Lucas numbers and polynomials and generalizations 11B37 Recurrences PDFBibTeX XMLCite \textit{R. Alter} and \textit{K. K. Kubota}, J. Comb. Theory, Ser. A 15, 243--256 (1973; Zbl 0273.10010) Full Text: DOI Online Encyclopedia of Integer Sequences: Catalan numbers: C(n) = binomial(2n,n)/(n+1) = (2n)!/(n!(n+1)!). a(n) = A000120(n+1) - 1 = wt(n+1) - 1. References: [1] Alter, R., Some remarks and results on Catalan numbers, (Mullin, R. C.; Reid, K. B.; Roselle, D. P.; Stanton, R. G., Proceedings of the Second Louisiana Conference on Combinatorics, Graph Theory, and Computing (1971), Louisiana State University: Louisiana State University Baton Rouge), 109-132 [2] Alter, R.; Curtz, T. B., On binary nonassociative products and their relation to a classical problem of Euler, Prace Mat., 13 (1972), in press [3] Brown, W. G., Historical note on a recurrent combinatorial problem, Amer. Math. Monthly, 72, 973-977 (1965) · Zbl 0136.21204 [4] Gould, H. W., Research bibliography of two special number sequences, (Mathematica Mononguliae (May 1971), Morgantown: Morgantown W. Va), No. 12 · Zbl 0226.10002 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.