English
Related papers

Related papers: Lucas sequences whose 12th or 9th term is a square

200 papers

In this paper we consider the generalized Catalan numbers F(s,n)= 1/((s-1)n+1) binom{sn}{n}. We find all $n$ such that for $p$ prime, p^q divides F(p^q,n), q>=1. As a byproduct we settle a question of Hough and the late Simion on the…

Number Theory · Mathematics 2007-05-23 Pantelimon Stanica

Let a tribonacci sequence be a sequence of integers satisfying $a_k=a_{k-1}+a_{k-2}+a_{k-3}$ for all $k\ge 4$. For any positive integers $k$ and $n$, denote by $f_k(n)$ the number of tribonacci sequences with $a_1, a_2, a_3>0$ and with…

Number Theory · Mathematics 2023-01-31 Luke Pebody

Let $p ,r $ and $n $ be positive integers. Then the O-Fibonacci $(p,r)$-cube $O\Gamma^{(p,r)}_{n}$ is the subgraph of $Q_{n}$ induced on the binary words in which there is at least $p-1$ zeros between any two $1$s and there is at most $r$…

Combinatorics · Mathematics 2019-10-15 Jianxin Wei , Guangfu Wang

In this work, we define a more general family of polynomials in several variables satisfying a linear recurrence relation. Then we provide explicit formulas and determinantal expressions. Finally, we apply these results to recurrent…

Number Theory · Mathematics 2023-05-23 Said Zriaa , Mohammed Mouçouf

We prove asymptotic 0-1 Laws satisfied by diagrams of unimodal sequences of positive integers. These diagrams consist of columns of squares in the plane, and the upper boundary is called the shape. For various types, we show that, as the…

Number Theory · Mathematics 2020-11-10 Walter Bridges

We explicitly solve the diophantine equations of the form $$ A_{n_1}A_{n_2}\cdots A_{n_k}\pm 1 = B_m^2 $$ where $(A_n)_{n\geq 0}$ and $(B_m)_{m\geq 0}$ are either the Fibonacci sequence or Lucas sequence. This extends the result of D.…

Number Theory · Mathematics 2017-08-01 Prapanpong Pongsriiam

In this paper, we provide new applications of Fibonacci and Lucas numbers. In some circumstances, we find algebraic structures on some sets defined with these numbers, we generalize Fibonacci and Lucas numbers by using an arbitrary binary…

Rings and Algebras · Mathematics 2019-11-19 Cristina Flaut , Diana Savin , Gianina Zaharia

In this paper, we prove that there is no x>=4 such that the difference of x-th powers of two consecutive Fibonacci numbers greater than 0 is a Lucas number.

Number Theory · Mathematics 2020-02-11 Zafer Şiar

Let $p$ be a prime number. A chain $\{p,2p+1,4p+3,\cdots,(p+1)2^{l(p)-1}-1\}$ is called the Cunningham chain generated by $p$ if all elements are prime number and $(p+1)2^{l(p)}-1$ is composite. Then $l(p)$ is called the length of the…

Number Theory · Mathematics 2022-05-25 Yuya Kanado

Let $T_{k}$ be the $k^{\textrm{th}}$ Tribonacci number and $L_{n}$ be the $n^{\textrm{th}}$ Lucas number defined by their respective recurrence relation $T_{k}=T_{k-1}+T_{k-2}+T_{k-3}$ and $L_{n}=L_{n-1}+L_{n-2}$. In this study, we solve…

Number Theory · Mathematics 2026-02-17 Ama Ahenfoa Quansah

We show that, if an integer sequence is given by a linear recurrence of constant rational coefficients, then it can be represented as the difference of two arithmetic terms with exponentiation, which do not contain any irrational constant.…

Logic · Mathematics 2025-06-09 Mihai Prunescu , Lorenzo Sauras-Altuzarra

We consider the tiling of an $n$-board (a $1\times n$ array of square cells of unit width) with half-squares ($\frac12\times1$ tiles) and $(\frac12,\frac12)$-fence tiles. A $(\frac12,\frac12)$-fence tile is composed of two half-squares…

Combinatorics · Mathematics 2019-11-05 Kenneth Edwards , Michael A. Allen

We speculate on the distribution of primes in exponentially growing, linear recurrence sequences $(u_n)_{n\geq 0}$ in the integers. By tweaking a heuristic which is successfully used to predict the number of prime values of polynomials, we…

Number Theory · Mathematics 2024-09-10 Jon Grantham , Andrew Granville

Let $ k \geq 2 $ and $ ( L_{n}^{(k)} )_{n \geq 2-k} $ be the $k-$generalized Lucas sequence with initial condition $ L_{2-k}^{(k)} = \cdots = L_{-1}^{(k)}=0 ,$ $ L_{0}^{(k,}=2,$ $ L_{1}^{(k)}=1$ and each term afterwards is the sum of the $…

Number Theory · Mathematics 2023-01-19 Alaa Altassan , Murat Alan

The aim of this paper is to give linear independence results for the values of certain series. As an application, we derive arithmetical properties of the sums of reciprocals of Fibonacci and Lucas numbers associated with certain coprime…

Number Theory · Mathematics 2019-08-21 Daniel Duverney , Yuta Suzuki , Yohei Tachiya

Given two variables $s$ and $t$, the associated sequence of Lucas polynomials is defined inductively by $\{0\}=0$, $\{1\}=1$, and $\{n\}=s\{n-1\}+t\{n-2\}$ for $n\ge2$. An integer (e.g., a Catalan number) defined by an expression of the…

Combinatorics · Mathematics 2019-09-09 Bruce E. Sagan , Jordan Tirrell

The Lucas polynomials, $\{n\}$, are polynomials in $s$ and $t$ given by $\{ n \} = s \{ n-1 \} + t \{ n-2 \}$ for $n \geq 2$ with $ \{ 0 \} = 0$ and $\{ 1 \} = 1$. The lucanomial coefficients, an analogue of the binomial coefficients, are…

Combinatorics · Mathematics 2019-10-22 Kristina Garrett , Kendra Killpatrick

Let $a$ and $b$ be relatively prime integers. Then the first Lucas sequence $\left(U_n\right)_{n\geq0}$ and the second Lucas sequence $\left(V_n\right)_{n\geq0}$ are defined respectively by $U_{n+2}=aU_{n+1}+bU_{n},\, U_0=0,\,U_1=1$ and…

Number Theory · Mathematics 2025-08-26 Hongjian Li , Huiming Xiao , Pingzhi Yuan

Recall that repdigit in base $g$ is a positive integer that has only one digit in its base $g$ expansion, i.e. a number of the form $a(g^m-1)/(g-1)$, for some positive integers $m\geq 1$, $g\geq 2$ and $1\leq a\leq g-1$. In the present…

Number Theory · Mathematics 2023-01-02 Kouessi Norbert Adedji , Alan Filipin , Alain Togbe

The Fibonacci cube $\Gamma_n$ is the subgraph of the hypercube $Q_n$ induced by vertices with no consecutive 1s. We study a one parameter generalization, p-th order Fibonacci cubes $\Gamma^{(p)}_n$, which are subgraphs of $Q_n$ induced by…

Combinatorics · Mathematics 2025-07-23 Michel Mollard