Related papers: The numbers of powers in the Tribonacci sequence

We compute the Frobenius number for numerical semigroups generated by the squares of three consecutive Fibonacci numbers. We achieve this by using and comparing three distinct algorithmic approaches: those developed by Ram\'irez Alfons\'in…

The Fibonacci sequence has been generalized in many ways. One of them is defined by the relation $t_n=at_{n-1}+t_{n-2}$ if $n$ is even, $t_n=bt_{n-1}+t_{n-2}$ if $n$ is odd, with initial values $t_0=0$ and $t_1=1$, where $a$ and $b$ are…

Let $ \{T_n\}_{n\geq 0} $ be the sequence of Tribonacci numbers. In this paper, we study the exponential Diophantine equation $T_n-2^x3^y=c$, for $n,x,y\in \mathbb{Z}_{\ge0}$. In particular, we show that there is no integer $c$ with at…

Inspired by the fact that the sum of the cubes of the first $n$ naturals is equal to the square of their sum, we explore, for each $n$, the Diophantine equation representing all non-trivial sets of $n$ integers with this property. We find…

A power is a word of the form $\underbrace{uu...u}_{k \; \text{times}}$, where $u$ is a word and $k$ is a positive integer and a square is a word of the form $uu$. Fraenkel and Simpson conjectured in 1998 that the number of distinct squares…

We study determinants of matrices whose entries are powers of Fibonacci numbers. We then extend the results to include entries that are powers of generalized Fibonacci numbers defined as a second-order linear recurrence relation. These…

The \textit{order of appearance} $ z(n) $ of a positive integer $ n $ in the Fibonacci sequence is defined as the smallest positive integer $ j $ such that $ n $ divides the $ j $-th Fibonacci number. A \textit{fixed point} arises when, for…

This short note reports a master theorem on tight asymptotic solutions to divide-and-conquer recurrences with more than one recursive term: for example, T(n) = 1/4 T(n/16) + 1/3 T(3n/5) + 4 T(n/100) + 10 T(n/300) + n^2.

For any integer $x$, let $T_x$ denote the triangular number $\frac{x(x+1)}{2}$. In this paper we give a complete characterization of all the triples of positive integers $(\alpha, \beta, \gamma)$ for which the ternary sums $\alpha x^2…

The $abc$ conjecture is a very deep concept in number theory with wide application to many areas of number theory. In this article we introduce the conjecture and give examples of its applications. In particular we apply the $abc$…

As is well-known, the ratio of adjacent Fibonacci numbers tends to phi = (1 + sqrt(5))/2, and the ratio of adjacent Tribonacci numbers (where each term is the sum of the three preceding numbers) tends to the real root eta of X^3 - X^2 - X -…

Let $ \{F_n\}_{n\ge 0} $ be the sequence of Fibonacci numbers and let $p$ be a prime. For an integer $c$ we write $m_{F,p}(c)$ for the number of distinct representations of $c$ as $F_k-p^\ell$ with $k\ge 2$ and $\ell\ge 0$. We prove that…

Let $\Bbb Z$ be the set of integers. For positive integers $a,b,c$ and $n$ let $N(a,b,c;n)$ be the number of representations of $n$ by $ax^2+by^2+cz^2$, and let $t(a,b,c;n)$ be the number of representations of $n$ by…

In this paper, closed forms of the summation formulas for generalized Tribonacci numbers are presented. Then, some previous results are recovered as particular cases of the present results. As special cases, we give summation formulas of…

Following Inoue et al., we define a word to be a repetition if it is a (fractional) power of exponent at least 2. A word has a repetition factorization if it is the product of repetitions. We study repetition factorizations in several…

We give an explicit description of the coefficients of the formal power series (1-x)(1-x^2)(1-x^3)(1-x^5)(1-x^8)(1-x^13)... In particular, we show that all the coefficients are equal to -1, 0 or 1.

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…

This work proposes a proof of the simplest cubic primes counting problem. It shows that the subset of primes {p = n^3 + 2 is prime : n => 1} is an infinite subset of primes. Further, the expected order of magnitude of the cubic primes…

In this paper, we obtain a general expression for the entries of the r. (r is integer) power of a certain n-square complex tridiagonal matrix. In addition, we get the complex factorizations of Fibonacci polynomials, Fibonacci and Pell…

If $\alpha$ is a non-zero algebraic number, we let $m(\alpha)$ denote the Mahler measure of the minimal polynomial of $\alpha$ over $\mathbb Z$. A series of articles by Dubickas and Smyth, and later by the author, develop a modified version…