Related papers: A Fibonacci type sequence with Prouhet-Thue-Morse …
Let $ k \geq 2 $ be an integer. The $ k- $generalized Fibonacci sequence is a sequence defined by the recurrence relation $ F_{n}^{(k)}=F_{n-1}^{(k)} + \cdots + F_{n-k}^{(k)}$ for all $ n \geq 2$ with the initial values $ F_{i}^{(k)}=0 $…
We discuss an equivalence relation on the set of square binary matrices with the same number of 1's in each row and each column. Each binary matrix is represented using ordered n-tuples of natural numbers. We give a few starting values of…
We show that every sequence $f_1, f_2, \cdots$ of real-valued random variables with $\sup_{n \in \N} \E (f_n^2) < \infty$ contains a subsequence $f_{k_1}, f_{k_2}, \cdots$ converging in \textsc{Ces\`aro} mean to some $\,f_\infty \in…
We develop a recursive scheme, as well as polynomial forms (polynomials in $n$ of degree $m$), for the evaluation of Ledin and Brousseau's Fibonacci sums of the form $S(m,n,r)=\sum_{k=1}^nk^mF_{k + r}$, $T(m,n,r)=\sum_{k=1}^nk^mL_{k + r}$…
We consider the structure of a variation of the Fibonacci sequence which is determined by a Bernoulli process. The associated structure of all Bernoulli variations of the Fibonacci sequence can be represented by a directed binary tree,…
The Fibonacci numbers are a sequence of integers in which every number after the first two, 0 and 1, is the sum of the two preceding numbers. These numbers are well known and algorithms to compute them are so easy that they are often used…
We prove various congruences for Catalan and Motzkin numbers as well as related sequences. The common thread is that all these sequences can be expressed in terms of binomial coefficients. Our techniques are combinatorial and algebraic:…
Morris constant term identity is important due to its equivalence with the well-known Selberg integral. We find a variation of the Morris constant term, denoted $h_n(t)$, in the study of the Ehrhart polynomial $H_n(t)$ of the $n$-th…
We introduce an elementary congruence-based procedure to look for q-th power multiples in arbitrary binary recurrence sequences (q>2). The procedure allows to prove that no such multiples exist in many instances.
A net occurrence of a repeated string in a text is an occurrence with unique left and right extensions, and the net frequency of the string is the number of its net occurrences in the text. Originally introduced for applications in Natural…
We present a certain generalization of a recent result of M. I. Cirnu on linear recurrence relations with coefficient in progressions [2]. We provide some interesting examples related to some well-known integer sequences, such as Fibonacci…
This paper presents random residue sequences derived from the number theoretic Hilbert (NHT) transform and their correlation properties. The autocorrelation of a NHT derived sequence is zero for all non-zero shifts which illustrates that…
Let $s_2$ be the sum-of-digits function in base $2$, which returns the number of non-zero binary digits of a nonnegative integer $n$. We study $s_2$ alon g arithmetic subsequences and show that --- up to a shift --- the set of $m$-tuples of…
The Tribonacci-Lucas sequence $\{S_n\}_{n\ge 0}$ is defined by the linear recurrence relation $S_{n+3} = S_{n+2} + S_{n+1} + S_n$, for $ n\ge 0 $, with the initial conditions $S_0 =S_2= 3$ and $S_1 = 1$. A palindromic number is a number…
We have studied several generalizations of Fibonacci sequences as the sequences with arbitrary initial values, the addition of two and more Fibonacci subsequences and Fibonacci polynomials with arbitrary bases. For Fibonacci numbers with…
One possible data encryption scheme is related to stream ciphers, which use a sufficiently long pseudo-random sequence. To increase the cryptographic strength of the cipher, linear shift algorithms (generated by linear recurrent sequences…
A composite positive integer n is Lehmer if \phi(n) divides n-1, where \phi(n) is the Euler's totient function. No Lehmer number is known, nor has it been proved that they don't exist. In 2007, the second author [7] proved that there is no…
Let $(u(n))_{n\in\mathbb{N}}$ be an arithmetic progression of natural integers in base $b\in\mathbb{N}\setminus \{0,1\}$. We consider the following sequences: $s(n)=\overline{u(0)u(1)\cdots u(n) }^b$ formed by concatenating the first $n+1$…
The Thue-Morse set $\mathcal{T}$ is the set of those non-negative integers whose binary expansions have an even number of $1$. The name of this set comes from the fact that its characteristic sequence is given by the famous Thue-Morse word…
We investigate the lengths and starting positions of the longest monochromatic arithmetic progressions for a fixed difference in the Fibonacci word. We provide a complete classification for their lengths in terms of a simple formula. Our…