中文
相关论文

相关论文: A short proof of Mathar's 2016 recurrence conjectu…

200 篇论文

For the OEIS sequence A214615, defined by $a(n) = M_{n}(1)$ where $M_{n}$ is the $n$-th Meixner polynomial satisfying $M_{n+1}(x) = x\,M_{n}(x) - n^{2}\,M_{n-1}(x)$, R.~J.~Mathar contributed on 6~March 2013 the conjectured order-2…

组合数学 · 数学 2026-05-07 Tong Niu

For the OEIS sequence A025166, defined by $a(n) = -n!\,2^{n}\,L_{n}(1/2)$ where $L_{n}$ is the Laguerre polynomial of degree $n$, R.~J.~Mathar contributed in February 2013 the conjectured order-2 P-recursive recurrence \[ a(n) + (-4n+3)\,…

组合数学 · 数学 2026-05-12 Tong Niu

For the OEIS sequence A002627, defined by the inhomogeneous first-order recurrence $a(n) = n\,a(n-1) + 1$ with $a(0) = 0$, R.~J.~Mathar recorded in February 2014 the conjectured second-order homogeneous recurrence \[ a(n) - (n+1)\,a(n-1) +…

组合数学 · 数学 2026-05-18 Tong Niu

For the OEIS sequence A001711, contributed by N. J. A. Sloane long before the on-line era and identified there as the diagonal $T(n+4, 4)$ of a generalized-Stirling triangle, R. J. Mathar contributed in February 2020 the conjectured order-2…

组合数学 · 数学 2026-05-13 Tong Niu

For the OEIS sequence A032123, the number of length-$2n$ black-and-white strings with $n$ black beads, considered up to reversal, R. J. Mathar contributed in November 2013 the conjectured order-5 P-recursive recurrence \[ \begin{aligned}…

组合数学 · 数学 2026-05-15 Tong Niu

For OEIS sequence A045406, the column-2 diagonal of the Lehmer-Comtet triangle A008296, R. J. Mathar contributed in September 2021 the conjectured order-2 P-recursive recurrence \[ a(n) + (2n-7)\,a(n-1) + (n-4)^{2}\,a(n-2) \;=\; 0,\qquad n…

组合数学 · 数学 2026-05-14 Tong Niu

For the OEIS sequence A348410, P. Bala recorded in February 2022 two equivalent closed forms, $a(n) = [x^{n}] ((1-x)(1-x^2))^{-n}$ and a single-index binomial sum. R. J. Mathar (October 2021) and V. Kotesovec (November 2021) each…

组合数学 · 数学 2026-05-19 Tong Niu

Every classical orthogonal polynomial system $p_n(x)$ satisfies a three-term recurrence relation of the type \[ p_{n+1}(x)=(A_nx+B_n)p_n(x)-C_np_{n-1}(x)~ (n=0,1,2,\ldots, p_{-1}\equiv 0), \] with $C_nA_nA_{n-1}>0$. Moreover, Favard's…

经典分析与常微分方程 · 数学 2019-01-14 Daniel Duviol Tcheutia

The Collatz Conjecture can be stated as: using the reduced Collatz function $C(n) = (3n+1)/2^x$ where $2^x$ is the largest power of 2 that divides $3n+1$, any odd integer $n$ will eventually reach 1 in $j$ iterations such that $C^j(n) = 1$.…

综合数学 · 数学 2019-10-18 Erhan Tezcan

We represent the generalized Collatz function with the recursive ruler function r(2n) = r(n) + 1 and r(2n + 1) = 1. We generate even-only and odd-only Collatz subsequences that contain significantly fewer elements term by term, to 2 and 1,…

综合数学 · 数学 2021-12-15 Robert Hill Nichols

The On-Line Encyclopedia Of Integer Sequences , that wonderful resource that most combinatorialists, and many other mathematicians and scientists, use at least once a day, is a treasure trove of mathematical information, and, one of its…

历史与综述 · 数学 2017-10-24 Shalosh B. Ekhad , Mingjia Yang , Doron Zeilberger

It is well known that the following Collatz Conjecture is one of the unsolved problems in mathematics. Collatz Conjecture: For any positive integer $n>1$, the following recursive algorithm will convergent to 1 by a finite number of steps.…

综合数学 · 数学 2022-09-28 Lei Li

The Collatz conjecture can be stated in terms of the reduced Collatz function R(x) = (3x+1)/2^m (where 2^m is the larger power of 2 that divides 3x+1). The conjecture is: Starting from any odd positive integer and repeating R(x) we…

数论 · 数学 2017-03-14 Livio Colussi

We prove an existing conjecture that the sequence defined recursively by $a_1=1, a_2=2, a_n=4a_{n-1}-2a_{n-2}$ counts the number of length-$n$ permutations avoiding the four generalized permutation patterns 1-32-4, 1-42-3, 2-31-4, and…

组合数学 · 数学 2017-06-28 Yonah Biers-Ariel

We investigate the sequence $(P_{n}(z))_{n=0}^{\infty}$ of random polynomials generated by the three-term recurrence relation $P_{n+1}(z)=z P_{n}(z)-a_{n} P_{n-1}(z)$, $n\geq 1$, with initial conditions $P_{\ell}(z)=z^{\ell}$, $\ell=0, 1$,…

概率论 · 数学 2023-08-30 Abey López García , Vasiliy A. Prokhorov

In this work, orthogonal polynomials satisfying $R_I$ type recurrence relation %$\mathcal{P}_{n+1}(z) = (z-c_n)\mathcal{P}_n(z)-\lambda_n (z-a_n)\mathcal{P}_{n-1}(z),$ with $\mathcal{P}_{-1}(z) = 0$ and $\mathcal{P}_0(z) = 1$ are analyzed…

经典分析与常微分方程 · 数学 2024-05-24 Vinay Shukla , A. Swaminathan

In this paper, we present a new method for the analysis of piecewise dynamical systems that are similar to the Collatz conjecture in regard to certain properties of the commutator of their sub-functions. We use the fact that the commutator…

综合数学 · 数学 2023-06-02 Benjamin T. Hendel , Rafael Ruggiero

A well-known conjecture of Gross and Zagier states that the values of the higher automorphic Green's function at pairs of points with complex multiplication in the upper half-plane are proportional to the logarithm of an algebraic number.…

数论 · 数学 2025-08-19 Francis Brown , Tiago J. Fonseca

In this paper, we confirm the following conjecture of Guo and Schlosser: for any odd integer $n>1$ and $M=(n+1)/2$ or $n-1$, $$ \sum_{k=0}^{M}[4k-1]_{q^2}[4k-1]^2\frac{(q^{-2};q^4)_k^4}{(q^4;q^4)_k^4}q^{4k}\equiv…

数论 · 数学 2020-06-01 Long Li , Su-Dan Wang

The Collatz conjecture asserts that repeatedly iterating $f(x) = (3x + 1)/2^{a(x)}$, where $a(x)$ is the highest exponent for which $2^{a(x)}$ exactly divides $3x+1$, always lead to $1$ for any odd positive integer $x$. Here, we present an…

综合数学 · 数学 2019-07-18 Zenon B. Batang
‹ 上一页 1 2 3 10 下一页 ›