Related papers: From Fibonacci Numbers to Central Limit Type Theor…

A positive integer $n$ is said to be a Zumkeller number or an integer-perfect number if the set of its positive divisors can be partitioned into two subsets of equal sums. In this paper, we prove several results regarding Zumkeller numbers.…

The Fibonacci polynomials are defined recursively as $f_{n}(x)=xf_{n-1}(x)+f_{n-2}(x)$, where $f_0(x) = 0$ and $f_1(x)= 1$. We generalize these polynomials to an arbitrary number of variables with the $r$-Fibonacci polynomial. We extend…

The paper is primarily concerned with the asymptotic behavior as $N\to\infty$ of averages of nonconventional arrays having the form $N^{-1}\sum_{n=1}^N\prod_{j=1}^\ell T^{P_j(n,N)}f_j$ where $f_j$'s are bounded measurable functions, $T$ is…

Fibonacci sequence, generated by summing the preceding two terms, is a classical sequence renowned for its elegant properties. In this paper, leveraging properties of generalized Fibonacci sequences and formulas for consecutive sums of…

Let $k\ge 2$ and $\{F_n^{(k)}\}_{n\geq 2-k}$ be the sequence of $k$--generalized Fibonacci numbers whose first $k$ terms are $0,\ldots,0,0,1$ and each term afterwards is the sum of the preceding $k$ terms. In this paper, we determine all…

The convolved Fibonacci numbers F_j^(r) are defined by (1-z-z^2)^{-r}=\sum_{j>=0}F_{j+1}^(r)z^j. In this note some related numbers that can be expressed in terms of convolved Fibonacci numbers are considered. These numbers appear in the…

In this note, we investigate some properties of the integer sequence of general term $a_n := \sum_{k = 0}^{n - 1} k! (n - k - 1)!$ ($\forall n \geq 1$) to derive a new identity of the Genocchi numbers $G_n$ ($n \in \mathbb{N}$), which…

Let $\alpha$ be a Steinhaus or a Rademacher random multiplicative function. For a wide class of multiplicative functions $f$ we show that the sum $\sum_{n \le x}\alpha(n) f(n)$, normalised to have mean square $1$, has a non-Gaussian…

In his book "250 Problems in Elementary Number Theory", W.Sierpinski shows that the numbers 1+2^(2^n)+2^(2^n+1) are divisible by 21; for n=1,2,.... In this paper, we prove a similar but more general result.Consider the natural numbers of…

Let $(L_n)_{n \geq 1}$ be the sequence of Lucas numbers, defined recursively by $L_1 := 1$, $L_2 := 3$, and $L_{n + 2} := L_{n + 1} + L_n$, for every integer $n \geq 1$. We determine the asymptotic behavior of $\log \operatorname{lcm} (L_1…

Let $P(m)$ denote the largest prime factor of an integer $m\geq 2$, and put $P(0)=P(1)=1$. For an integer $k\geq 2$, let $(F_{n}^{(k)})_{n\geq 2-k}$ be the $k-$generalized Fibonacci sequence which starts with $0,...,0,1$ ($k$ terms) and…

Let $r=r(n)$ be a sequence of integers such that $r\leq n$ and let $X_1,\ldots,X_{r+1}$ be independent random points distributed according to the Gaussian, the Beta or the spherical distribution on $\mathbb{R}^n$. Limit theorems for the…

Chung and Graham introduced a method to uniquely represent each positive integer using even-indexed Fibonacci terms. We generalize this result to represent each positive integer using other Fibonacci terms with equally-spaced indices.

The pentagonal numbers are the integers given by $p_5(n)=n(3n-1)/2\ (n=0,1,2,\ldots)$. Let $(b,c,d)$ be one of the triples $(1,1,2),(1,2,3),(1,2,6)$ and $(2,3,4)$. We show that each $n=0,1,2,\ldots$ can be written as $w+bx+cy+dz$ with…

We study binomially weighted summation methods given by \[ (x_n)_{n\in \mathbb{N}} \mapsto \left(\sum_{k=0}^n\binom{n}{k}r^k(1-r)^{n-k}x_k\right)_{n\in \mathbb{N}} \] for $r\in (0,1)$, and their behavior under composition with summation…

For any integer $r\ge2$, define a sequence of numbers $\{c_k^{(r)}\}_{k=0}^\infty$, independent of the parameter $n$, by $$ \sum_{k=0}^n{\binom nk}^r{\binom{n+k}k}^r =\sum_{k=0}^n\binom nk\binom{n+k}kc_k^{(r)}, \qquad n=0,1,2,...c. $$ We…

We use generalised Zeckendorf representations of natural numbers to investigate mixing properties of symbolic dynamical systems. The systems we consider consist of bi-infinite sequences associated with so-called random substitutions. We…

For any integer $r \geq 1$, the sequence of numbers $\{{c^{(r)}_{k}}\}_{k \geq 0} $ is defined implicitly by [\sum_k\binom{n}{k}^r\binom{n+k}{k}^r = \sum_k\binom{n}{k}\binom{n+k}{k}c^{(r)}_k,\quad n=0,1,2,...] Asmus Schmidt conjectured that…

Let ``Faulhaber's formula'' refer to an expression for the sum of powers of integers written with terms in n(n+1)/2. Initially, the author used Faulhaber's formula to explain why odd Bernoulli numbers are equal to zero. Next, Cereceda gave…

Given a sequence of subsets A_n of {0,...,n-1}, the Furstenberg correspondence principle provides a shift-invariant measure on Cantor space that encodes combinatorial information about infinitely many of the A_n's. Here it is shown that…