Related papers: Fibonacci numbers, Euler's 2-periodic continued fr…

In this expository paper written to commemorate Fibonacci Day 2016, we discuss famous relations involving the Fibonacci sequence, the golden ratio, continued fractions and nested radicals, and show how these fit into a more general…

The Fibonacci sequence $\mathbb{F}$ is the fixed point beginning with $a$ of morphism $\sigma(a,b)=(ab,a)$. In this paper, we get the explicit expressions of all squares and cubes, then we determine the number of distinct squares and cubes…

Continued fractions are linked to Stern's diatomic sequence 0,1,1,2,1,3,2,3,1,4,... (given by the recursion relation a_2n=a_n and a_{2n+1} = a_n + a_{n+1}, where a_0=0 and a_1=1), which has long been known. Using a particular…

We study Gibonacci sequences mod $m$, giving special attention to the Lucas numbers. It is known which $m$ have the property that the Fibonacci sequence contains all residues mod $m$. When $m$ has this property, we say that the Fibonacci…

In this paper, we introduce the concept of $F$-perfect number, which is a positive integer $n$ such that $\sum_{d|n,d<n}d^2=3n$. We prove that all the $F$-perfect numbers are of the form $n=F_{2k-1}F_{2k+1}$, where both $F_{2k-1}$ and…

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…

We study generalized Fibonacci sequences $F_{n+1}=PF_n-QF_{n-1}$ with initial values $F_0=0$ and $F_1=1$. Let $P,Q$ be nonzero integers such that $P^2-4Q$ is not a perfect square. We show that if $Q=\pm 1$ then the sequence…

We describe a simple method that produces automatically closed forms for the coefficients of continued fractions expansions of a large number of special functions. The function is specified by a non-linear differential equation and initial…

The document tries to put focus on sequences with certain properties and periods leading to the first value smaller than the starting value in the Collatz problem. With the idea that, if all starting numbers lead ultimately to a smaller…

The continued fraction mapping maps a number in the interval $[0,1)$ to the sequence of its partial quotients. When restricted to the set of irrationals, which is a subspace of the Euclidean space $\mathbb{R}$, the continued fraction…

We derive a general recurrence relation for squares of Fibonacci-like numbers. Various properties are developed, including double binomial summation identites.

We extend the close interplay between continued fractions, orthogonal polynomials, and Gaussian quadrature rules to several variables in a special but natural setting which we characterize in terms of moment sequences. The crucial condition…

We put forward several general conjectures concerning the algebraicity or transcendence of continued fractions and Stieltjes continued fractions defined by the Thue-Morse and period-doubling sequences in characteristic $2$. We present our…

Let s_k/t_k, k>= 0, be the convergents of the continued fraction expansion of a real number x. We investigate the sequence of Jacobi symbols (s_k/t_k), k>= 0. We show that this sequence is purely periodic with shortest possible period…

Exploiting an iterative formula already introduced in a previous manuscript to count the number $O_d$ of finite $O$-sequences of multiplicity $d$, we obtain some new information about $O_d$. Letting $A_d$ be the number of the finite…

Based on the combinatorial interpretation of the ordered Bell numbers, which count all the ordered partitions of the set $[n]=\{1,2,\dots,n\}$, we introduce the Fibonacci partition as a Fibonacci permutation of its blocks. Then we define…

I propose and investigate the use of continuous functional equations for the study of meta-Fibonacci integer sequences. This exploratory study includes three sequences with quite different behavior: Conway's famous sequence $A(n)=…

Let $a, b\in \mathbb{N}$ be relatively prime. Previous work showed that exactly one of the two equations $ax + by = (a-1)(b-1)/2$ and $ax + by + 1 = (a-1)(b-1)/2$ has a nonnegative, integral solution; furthermore, the solution is unique.…

A generalization of the well-known Fibonacci sequence is the $k$-Fibonacci sequence with some fixed integer $k\ge 2$. The first $k$ terms of this sequence are $0,0, \ldots, 1$, and each term afterwards is the sum of the preceding $k$ terms.…

It is known that binary words containing no $k$ consecutive 1s are enumerated by $k$-step Fibonacci numbers. In this note we discuss the expected value of a random bit in a random word of length $n$ having this property.