Related papers: On integer values of the generating functions for …
We study higher-dimensional interlacing Fibonacci sequences, generated via both Chebyshev type functions and $m$-dimensional recurrence relations. For each integer $m$, there exist both rational and integer versions of these sequences,…
In this paper, we define the bi-periodic Fibonacci matrix sequence that represent bi-periodic Fibonacci numbers. Then, we investigate generating function, Binet formula and summations of bi-periodic Fibonacci matrix sequence. After that, we…
Sequences are often conveniently encoded in the form of a generating function depending on a formal variable. This note presents two observations that allow one to draw conclusions about the generated sequence from the generating function.…
A Lucas sequence is a sequence of the general form $v_n = (\phi^n - \bar{\phi}^n)/(\phi-\bar{\phi})$, where $\phi$ and $\bar{\phi}$ are real algebraic integers such that $\phi+\bar{\phi}$ and $\phi\bar{\phi}$ are both rational. Famous…
The aim of this expository article is twofold. The first is to introduce several polynomials of one variable as well as two variables defined on the positive integers with values as congruent numbers. The second is to present connections…
The exponential generating functions of {n^(n+m)} for arbitrary integer m are expressed as rational functions of the e.g.f. of {n^(n-1)} [the tree function] and then of the e.g.f. of {n^n} [the endofunction function]. The coefficients in…
We focus on the generating series for the rational special values of Pellarin's $L$-series in $1 \leq s \leq 2(q-1)$ indeterminates, and using interpolation polynomials we prove a closed form formula relating this generating series to the…
We construct new integral representations for transformations of the ordinary generating function for a sequence, $\langle f_n \rangle$, into the form of a generating function that enumerates the corresponding "square series" generating…
A quick way to compute generating functions related to Pell-Padovan tetranacci numbers and classical sequences of recursions of order two is provided. Eight special instances can be computed at once.
In this paper, we define a new product over $\mathbb{R}^{\infty}$, which allows us to obtain a group isomorphic to $\mathbb R^*$ with the usual product. This operation unexpectedly offers an interpretation of the R\'edei rational functions,…
A \Def{composition} of a positive integer $n$ is a $k$-tuple $(\l_1, \l_2, \dots, \l_k) \in \Z_{> 0}^k$ such that $n = \l_1 + \l_2 + \dots + \l_k$. Our goal is to enumerate those compositions whose parts $\l_1, \l_2, \dots, \l_k$ avoid a…
In this study, we introduce a new classes of quaternion numbers. We show that this new classes quaternion numbers include all of quaternion numbers such as Fibonacci, Lucas, Pell, Jacobsthal, Pell-Lucas, Jacobsthal-Lucas quaternions have…
There are several standard procedures used to create new sequences from a given sequence or from a given pair of sequences. In this paper I discuss the most popular of these procedures. For each procedure, I give a definition and provide…
The main purpose of this paper is to construct new families of special numbers with their generating functions. These numbers are related to the many well-known numbers, which are the Bernoulli numbers, the Fibonacci numbers, the Lucas…
The Pearcey process is a universal point process in random matrix theory. In this paper, we study the generating function of the Pearcey process on any number $m$ of intervals. We derive an integral representation for it in terms of a…
As a report of a teaching experience, we analyse Haskell programs computing two integer sequences: the Hamming sequence and the Ulam sequence. For both of them, we investigate two strategies of computation: the first is based on filtering…
The following article summarizes research where theorems and their respective demonstrations are postulated based on quadratic equations with special properties given by the Pythagorean triplets and the Fibonacci sequence given the second…
In this paper, we study a family of generating functions whose coefficients are polynomials that enumerate partitions in lower order ideals of Young's lattice. Our main result is that this family satisfies a rational recursion and are…
The Pell equation $x^2 - Dy^2 = 1$ with non-square $D > 1$ has infinitely many integer solutions, yet most research has centered on the asymptotic behavior of fundamental units as $D$ varies. By contrast, the exact distribution of solutions…
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…