English
Related papers

Related papers: A Note on the Fibonacci Sequence and Schreier-type…

200 papers

Initiated by Davis, Nelson, Petersen and Tenner (2018), the enumerative study of pinnacle sets of permutations has attracted a fair amount of attention recently. In this article, we provide a recurrence that can be used to compute…

Combinatorics · Mathematics 2023-06-22 Wenjie Fang

In this paper, it is proved that there is an arithmetic progression of positive integers such that each of which is expressible neither as $p+F_m$ nor as $q+L_n$, where $ p,q $ are primes, $ F_m $ denotes the $ m $-th Fibonacci number and $…

General Mathematics · Mathematics 2025-06-17 Rui-Jing Wang

In this note, we give an alternative proof of the following result. Let p, q >= 2 be two multiplicatively independent integers. If an infinite set of integers is both p- and q-recognizable, then it is syndetic. Notice that this result is…

Formal Languages and Automata Theory · Computer Science 2009-07-06 M. Rigo , L. Waxweiler

It's the age-old recurrence with a twist: sum the last two terms and if the result is composite, divide by its smallest prime divisor to get the next term (e.g., 0, 1, 1, 2, 3, 5, 4, 3, 7, ...). These sequences exhibit pseudo-random…

Number Theory · Mathematics 2016-01-06 Richard K. Guy , Tanya Khovanova , Julian Salazar

The paper considers the problem of finding the largest possible set P(n), a subset of the set N of the natural numbers, with the property that a number is in P(n) if and only if it is a sum of n distinct naturals all in P(n) or none in…

Discrete Mathematics · Computer Science 2008-09-18 Bidu Prakash Das , Soubhik Chakraborty

A sequence of nonzero integers $f = (f_1, f_2, \dots)$ is ``binomid'' if every $f$-binomid coefficient $\left[\! \begin{array}{c} n \\ k \end{array}\! \right]_f$ is an integer. Those terms are the generalized binomial coefficients: \[…

Number Theory · Mathematics 2023-02-07 Daniel B. Shapiro

Let $(X, \mathcal{B},\mu,T)$ be an ergodic measure preserving system, $A \in \mathcal{B}$ and $\epsilon>0$. We study the largeness of sets of the form \begin{equation*} \begin{split} S = \left\{ n\in\mathbb{N}\colon\mu(A\cap…

Dynamical Systems · Mathematics 2019-08-06 Sebastián Donoso , Anh N. Le , Joel Moreira , Wenbo Sun

We study two kinds of random Fibonacci sequences defined by $F_1=F_2=1$ and for $n\ge 1$, $F_{n+2} = F_{n+1} \pm F_{n}$ (linear case) or $F_{n+2} = |F_{n+1} \pm F_{n}|$ (non-linear case), where each sign is independent and either + with…

Probability · Mathematics 2008-09-29 Elise Janvresse , Benoît Rittaud , Thierry De La Rue

In this paper, we present a method for estimating the least common multiple of a large class of binary linear recurrence sequences. Let $P,Q,R_0$, and $R_1$ be fixed integers and let $\boldsymbol{R}=\left(R_n\right)_{n}$ be the recurrence…

Number Theory · Mathematics 2020-11-10 Sid Ali Bousla

Hofstadter's Q-sequence remains an enigma fifty years after its introduction. Initially, the terms of the sequence increase monotonically by 0 or 1 at a time. But, Q(12)=8 while Q(11)=6, and monotonicity fails shortly thereafter. In this…

Number Theory · Mathematics 2016-11-28 Nathan Fox

One of the most interesting results of the last century was the proof completed by Matijasevich that computably enumerable sets are precisely the diophantine sets [MRDP Theorem, 9], thus settling, based on previously developed machinery,…

Combinatorics · Mathematics 2016-09-12 Soumyabrata Pal , Shankar M. Venkatesan

By using Andrews's explicit formulae of the $q$-Fibonacci sequence introduced by Schur, we prove certain congruences of the $q$-Fibonacci sequence which relate the sequence with the original Fibonacci sequence. As a corollary, we show that…

Number Theory · Mathematics 2023-01-31 Takumi Anzawa , Hidetaka Funakura

Let $B$ be a finite set of natural numbers or complex numbers. Product set corresponding to $B$ is defined by $B.B:=\{ab:a,b\in B\}$. In this paper we give an upper bound for longest length of consecutive terms of a polynomial sequence…

Number Theory · Mathematics 2015-11-11 Sai Teja Somu

In this note, we show that the sequence of maximum values in frieze patterns of type $A_n$ is the sequence of Fibonacci numbers, and that of frieze patterns of type $C_n$ is the sequence of odd Fibonacci numbers.

Combinatorics · Mathematics 2024-11-05 Jon Cheah , Antoine de Saint Germain

We introduce the $2$-regular integer sequence A383066 $= (s(n))_{n \geq 1}$, which begins $0, 1, 1, 2, 3, 3, 2, \ldots$. We prove that the number of occurrences of an integer $m \geq 0$ in this sequence is equal to $\tau(m^2+1)$, the number…

Number Theory · Mathematics 2025-10-28 Anton Shakov

Fibonacci chains are special diatomic, harmonic chains with uniform nearest neighbour interaction and two kinds of atoms (mass-ratio $r$) arranged according to the self-similar binary Fibonacci sequence $ABAABABA...$, which is obtained by…

Condensed Matter · Physics 2007-05-23 Wolfdieter Lang

Given a subset $S\subseteq\mathbb{P}$, let $\Pa(S;n)$ be the number of permutations in the symmetric group of ${1,2,...,n}$ that have peak set $S$. We prove a recent conjecture due to Billey, Burdzy and Sagan, which determines the sets that…

Combinatorics · Mathematics 2012-10-23 Anisse Kasraoui

We study sets of the form $A = \big\{ n \in \mathbb N \big| \lVert p(n) \rVert_{\mathbb R / \mathbb Z} \leq \varepsilon(n) \big\}$ for various real valued polynomials $p$ and decay rates $\varepsilon$. In particular, we ask when such sets…

Number Theory · Mathematics 2018-07-20 Jakub Konieczny

Let $\mathbb{F}_q$ be the field with $q$ elements and of characteristic $p$. For $a\in\mathbb{F}_p$ consider the set \begin{equation*} S_a(n)=\{f\in\mathbb{F}_q[x]\mid\operatorname{deg}(f)=n,~f\text{ irreducible, monic and}…

Number Theory · Mathematics 2023-12-29 Max Schulz

Through the following, we establish the conditions which allow us to express recursive sequences of real numbers, enumerated through the recurrence relation a_{n+1} = Aa_n + Ba_{n-1}, by means of algebraic equations in two variables of…

Number Theory · Mathematics 2008-03-25 Luigi Cimmino