English
Related papers

Related papers: Two integer sequences related to Catalan numbers

200 papers

Let $a=(a_1,\ldots,a_n)$ and $b=(b_1,\ldots,b_n)$ be two $n$-tuples of positive integers, let $X$ be a set of positive integers, and let $g$ be a positive integer. In this work we show an algorithmic process in order to compute all the sets…

Combinatorics · Mathematics 2019-04-10 Aureliano M. Robles-Pérez , José Carlos Rosales

Motivated by representation theory we exhibit an interior structure to Catalan sequences and many generalisations thereof. Certain of these coincide with well known (but heretofore isolated) structures. The remainder are new.

Combinatorics · Mathematics 2020-12-21 Bethany Marsh , Paul Martin

The Super-Catalan numbers are a generalization of the Catalan numbers defined as $T(m,n) = \frac{(2m)!(2n)!}{2m!n!(m+n)!}$. It is an open problem to find a combinatorial interpretation for $T(m,n)$. We resolve this for $m=3,4$ using a…

Combinatorics · Mathematics 2020-08-04 Irina Gheorghiciuc , Gidon Orelowitz

We define a sequence of positive integers recursively, where each term is determined as follows: starting with a given positive integer, if the term is odd, the next is the sum of its positive divisors; if the term is even, the subsequent…

Number Theory · Mathematics 2025-06-04 Ritesh Dwivedi , Rohit Yadav

Consider the recursive relation generating a new positive integer $n_{\ell +1}$ from the positive integer $n_{\ell }$ according to the following simple rules: if the integer $n_{\ell }$ is odd, $n_{\ell +1}=3n_{\ell }+1$; if the integer…

General Mathematics · Mathematics 2023-03-16 Mario Bruschi , Francesco Calogero

We study the properties of the odd Catalan numbers, C_n, modulo 2^k for k >= 2. We show that there exist only k - 1 different congruences of the odd Catalan numbers modulo 2^k. Moreover, these congruences can be obtained by C_{2^m - 1} (mod…

Number Theory · Mathematics 2011-01-12 Hsueh-Yung Lin

Easily computable lower and upper bounds are found for the sum of Catalan numbers. The lower bound is proven to be tighter than the upper bound, which previously was declared to be only an asymptotic. The average of these bounds is proven…

Combinatorics · Mathematics 2016-03-22 Kevin Topley

We investigate the divisibility properties of \sigma(C_n), the sum-of-divisors function applied to Catalan numbers, in relation to other number-theoretic functions. We establish conditions under which C_n has prime factors of the form 6k-1,…

Combinatorics · Mathematics 2025-02-10 Volkan Yildiz

We show for a class of sequences $(a_n)_{n\geq 1}$ of distinct positive integers, that for no $\alpha$ the sequence $(\left\{a_n \alpha \right\})_{n \geq 1}$ does have Poissonian pair correlation. This class contains for example all…

Number Theory · Mathematics 2018-01-31 Gerhard Larcher

Sequence of positive integers $\{x_n\}_{n\geq1}$ is called similar to $\mathbb {N}$ respectively a given property $A$ if for every $n\geq1$ the numbers $x_n$ and $n$ are in the same class of equivalence respectively $A\enskip(x_n\sim n…

Number Theory · Mathematics 2009-04-20 Vladimir Shevelev

In this note, we provide bijective proofs of some identities involving the Bell number, as previously requested. Our arguments may be extended to yield a generalization in terms of complete Bell polynomials. We also provide a further…

Combinatorics · Mathematics 2014-01-28 Mark Shattuck

We consider planar cubic maps, i.e. connected cubic graphs imbedded into plane, with marked spanning tree and marked directed edge (not in this tree). The number of such objects with $2n$ vertices is $C_{2n}\cdot C_{n+1}$, where $C_k$ is…

Combinatorics · Mathematics 2016-08-09 Yury Kochetkov

In this paper, we define four transformations on the classical Catalan triangle $\mathcal{C}=(C_{n,k})_{n\geq k\geq 0}$ with $C_{n,k}=\frac{k+1}{n+1}\binom{2n-k}{n}$. The first three ones are based on the determinant and the forth is…

Combinatorics · Mathematics 2013-05-10 Yidong Sun , Fei Ma

This paper presents a two-phase algorithm for computing exact Catalan numbers at an unprecedented scale. The method is demonstrated by computing $C(n)$ for $n = 2,050,572,903$ yielding a result with a targeted $1,234,567,890$ decimal…

Data Structures and Algorithms · Computer Science 2026-01-21 Mahesh Ramani

We give conjectures on the form of families of integer sequences whose Hankel transforms are, respectively, $(\alpha, \beta)$ Somos $4$ sequences, $(\alpha, 0, \gamma)$ Somos $6$ sequences, and $(\alpha, \beta, \gamma, \delta)$ Somos $8$…

Combinatorics · Mathematics 2022-11-24 Paul Barry

For each positive integer $m$, the $m$th order harmonic numbers are given by $$H_n^{(m)}=\sum_{0<k\le n}\frac1{k^m}\ \ (n=0,1,2,\ldots).$$ We discover exact values of some series involving harmonic numbers of order not exceeding four. For…

Number Theory · Mathematics 2025-03-04 Zhi-Wei Sun

Hexaflexagons were popularized by the late Martin Gardner in his first Scientific American column in 1956. Oakley and Wisner showed that they can be represented abstractly by certain recursively defined permutations called pats, and deduced…

Combinatorics · Mathematics 2010-06-04 David Callan

For any integer $r \geq 1$, the sequence of numbers $\{{c^{(r)}_{k}}\}_{k \geq 0} $ is defined implicitly by [\sum_k\binom{n}{k}^r\binom{n+k}{k}^r = \sum_k\binom{n}{k}\binom{n+k}{k}c^{(r)}_k,\quad n=0,1,2,...] Asmus Schmidt conjectured that…

Combinatorics · Mathematics 2013-08-07 Thotsaporn "Aek" Thanatipanonda

Let $n$ and $r$ be positive integers. Define the numbers $S_n^{(r)}$ by $S_n^{(r)}=\sum_{k=0}^n\binom{n}{k}^2\binom{2k}{k}(2k+1)^r.$ In this paper we prove some conjectures of Guo and Liu which extend some conjectures of Z.-W. Sun…

Number Theory · Mathematics 2019-01-28 Guo-Shuai Mao

We mainly show a supercongruence for a truncated series with cubes of Catalan numbers which extends a result by Zhi-Wei Sun.

Number Theory · Mathematics 2018-08-02 Roberto Tauraso
‹ Prev 1 3 4 5 6 7 10 Next ›