Related papers: Pell-Padovan tetranacci numbers and their Hadamard…
This short paper presents an exact formula for counting twin prime pairs less than or equal to x in terms of the classical Smarandache Function. An extension of the formula to count prime pairs (p, p+2n), n > 1, is also given.
We introduce a simple algorithm that efficiently computes tensor products of Pauli matrices. This is done by tailoring the calculations to this specific case, which allows to avoid unnecessary calculations. The strength of this strategy is…
In this paper, we give recurrence relations and identities for some integer sequences related to Ward numbers such as Ward-Lah numbers, varied Ward numbers and binomial Ward numbers. Most of the sequences are entered in the On-Line…
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…
Six families of generalized hypergeometric series in a variable $x$ and an arbitrary number of parameters are considered. Each of them is indexed by an integer $n$. Linear recurrence relations in $n$ relate these functions and their product…
We introduce quaternary Legendre pairs of length $\ell$. In contrast to binary Legendre pairs they can exist for even $\ell$ as well. First we show that they are pertinent to the construction of quaternary Hadamard matrices of order…
We show that, if an integer sequence is given by a linear recurrence of constant rational coefficients, then it can be represented as the difference of two arithmetic terms with exponentiation, which do not contain any irrational constant.…
New methods for derivation of Bell polynomials of the second kind are presented. The methods are based on an ordinary generating function and its composita. The relation between a composita and a Bell polynomial is demonstrated. Main…
We describe a complete algorithm to compute millions of coefficients of classical modular forms in a few seconds. We also review operations on Euler products and illustrate our methods with a computation of triple product L-function of…
We present a simple and fast algorithm for computing the $N$-th term of a given linearly recurrent sequence. Our new algorithm uses $O(\mathsf{M}(d) \log N)$ arithmetic operations, where $d$ is the order of the recurrence, and…
We establish a simple recurrence formula for the number $Q_g^n$ of rooted orientable maps counted by edges and genus. We also give a weighted variant for the generating polynomial $Q_g^n(x)$ where $x$ is a parameter taking the number of…
Convolutions for Tribonacci numbers involving binomial coefficients are treated with ordinary generating functions and the diagonalization method of Hautus and Klarner. In this way, the relevant generating function can be established, which…
In this paper we modify a fundamental block construction of Kharaghani and Seberry and show how to use certain circulant $\{-1,1\}$-matrices of odd order $p$ to construct a complex Hadamard matrix of order $2p$. In particular, for $p=47$ we…
We study certain series with Catalan numbers and reciprocal Catalan numbers, respectively, and provide seemingly new closed form evaluations of these series with Fibonacci (Lucas) entries. In addition, we state some combinatorial sums that…
Hadamard matrices are square $n\times n$ matrices whose entries are ones and minus ones and whose rows are orthogonal to each other with respect to the standard scalar product in $\Bbb R^n$. Each Hadamard matrix can be transformed to a…
In this paper, we connect two well established theories, the Fibonacci numbers and the Jordan algebras. We give a series of matrices, from literature, used to obtain recurrence relations of second-order and polynomial sequences. We also…
We describe how the reversion of a series is related to convolutional recurrence relations for the series, and we place this relationship in the context of Riordan arrays. As an example of the approach, we give new recurrence relations for…
We introduce the degenerate Bernoulli numbers of the second kind as a degenerate version of the Bernoulli numbers of the second kind. We derive a family of nonlinear differential equations satisfied by a function closely related to the…
In this article we gave a recurrence to obtain the n-th prime number as function of the (n-1)-th prime number.
This paper examines the recursive sequence of polynomials $p_n(x)$, defined by $p_0(x) = x^2 - 2$ and $p_n(x) = p_{n-1}(x)^2 - 2$ for $n \geq 1$. It describes the field-theoretic motivations behind this sequence, derives a recursive formula…