Related papers: On Base 3/2 and its Sequences
The Fibonacci sequence is a sequence of numbers that has been studied for hundreds of years. In this paper, we introduce the new sequence S_{k,n} with initial conditions S_{k,0} = 2b and S_{k,1} = bk + a, which is generated by the…
Determinants and symmetric functions of the eigenvalues of matrices characterizing stochastic processes with indepedent increments. Relationships with Fibonacci numbers are derived.
In this paper, we consider the new family of recurrence sequences of $(q,k)$-generalized Fibonacci numbers. These sequences naturally extend the well-known sequences of $k$-generalized Fibonacci numbers and generalized $k$-order Pell…
This paper investigates a variant of the famous "happy numbers" sequence, given by A351327 on the oeis. First of all we'll define this integer sequence, and then we'll show some important results about it; in particular we conjectured that…
In this paper, we first give new generalizations for third-order Horadam $\{H_{n}^{(3)}\}_{n\in \mathbb{N}}$ and generalized Tribonacci $\{h_{n}^{(3)}\}_{n\in \mathbb{N}}$ sequences for classic Horadam and generalized Fibonacci numbers.…
In this study, we introduce the generalized Tribonacci hyperbolic spinors and properties of this new special numbers system by the generalized Tribonacci numbers, which are one of the most general form of the third-order recurrence…
Divide-and-conquer functions satisfy equations in F(z),F(z^2),F(z^4)... Their generated sequences are mainly used in computer science, and they were analyzed pragmatically, that is, now and then a sequence was picked out for scrutiny. By…
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.
We define a sequence of positive integers recursively, where each term is determined as follows: starting with a given positive integer, if the term is odd, the next is the sum of its positive divisors; if the term is even, the subsequent…
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,\ldots,0,1$, and each term afterwards is the sum of the preceding $k$ terms.…
One presents many Concatenated and Operation Sequences, P-Q Relationships, Digital Sequences, Magic Squares, Prime Conjectures, k-Divisibility and Strong Divisibility Sequences, Geometric Conjectures, Proposed problems.
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: \[…
We study a certain family of infinite series with reciprocal Catalan numbers. We first evaluate two special candidates of the family in closed form, where we also present some Catalan-Fibonacci relations. Then we focus on the general…
Number systems with a rational number $a/b > 1$ as base have gained interest in recent years. In particular, relations to Mahler's 3/2-problem as well as the Josephus problem have been established. In the present paper we show that the…
In additive number theory, a finite set $A$ of integers is an $h$-basis for $n$ if every integer in $\{0,1,2,\ldots, n\}$ can be represented as the sum of exactly $h$ not necessarily distinct elements of $A$. This paper introduces a new…
Let $p$ be an odd prime. In the paper we collect the author's various conjectures on congruences modulo $p$ or $p^2$, which are concerned with sums of binomial coefficients, Lucas sequences, power residues and special binary quadratic…
The Fibonacci sequence is obtained as weighted sum along the rows in the Pascal triangle by choosing a periodic up-and-down pattern of weights from the set $\{-1,-\frac{1}{2},0, \frac{1}{2}, 1\}$. A graphical illustration of this identity…
Let $(P,\leq)$ be a finite poset (partially ordered set), where $P$ has cardinality $n$. Consider linear extensions of $P$ as permutations $x_1x_2\cdots x_n$ in one-line notation. For distinct elements $x,y\in P$, we define…
We study $B(n;k)$, the number of ways of writing $n$ as a sum or difference of the first $k$ Fibonacci numbers. We show that $B(0;k)$ satisfies the Tribonacci-like recurrence $B(0;k+1)=B(0;k)+B(0;k-1)+B(0;k-2)$ and that $B(n;k)$ satisfies a…
We introduce numbers depending on three parameters which we call skyscraper numbers. We discuss properties of these numbers and their relationship with Stirling numbers of the first kind, and we also introduce a skyscraper sequence.