Related papers: A Linear Representation for Constant Term Sequence…

We show that Stieltjes moment sequences are infinitely log-convex, which parallels a famous result that (finite) P\'olya frequency sequences are infinitely log-concave. We introduce the concept of $q$-Stieltjes moment sequences of…

We present a finite-order system of recurrence relations for a permanent of circulant matrices containing a band of k any-value diagonals on top of a uniform matrix (for k = 1, 2, and 3) as well as the method for deriving such recurrence…

For a sequence of polynomials $\{p_k(t)\}$ in one real or complex variable, where $p_k$ has degree $k$, for $k\ge 0$, we find explicit expressions and recurrence relations for infinite matrices whose entries are the coefficients $d(n,m,k)$,…

We study how well Fekete polynomials $$ F_p(X) = \sum_{n=0}^{p-1} \left(\frac{n}{p}\right) X^n \in {\mathbb Z}[X] $$ with the coefficients given by Legendre symbols modulo a prime $p$, can be approximated by power series representing…

In this paper, we construct four binary linear codes closely connected with certain exponential sums over the finite field F_q and F_q-{0,1}. Here q is a power of two. Then we obtain four recursive formulas for the power moments of…

Let p be a prime and let a be a positive integer. In this paper we determine $\sum_{k=0}^{p^a-1}\binom{2k}{k+d}/m^k$ and $\sum_{k=1}^{p-1}\binom{2k}{k+d}/(km^{k-1})$ modulo $p$ for all d=0,...,p^a, where m is any integer not divisible by p.…

Let q>1 and m>0 be relatively prime integers. We find an explicit period $\nu_m(q)$ such that for any integers n>0 and r we have $[n+\nu_m(q),r]_m(a)=[n,r]_m(a) (mod q)$ whenever a is an integer with $\gcd(1-(-a)^m,q)=1$, or a=-1 (mod q),…

Fix a finite set $S \subset {GL}(k,\mathbb{Z})$. Denote by $a_n$ the number of products of matrices in $S$ of length $n$ that are equal to 1. We show that the sequence $\{a_n\}$ is not always P-recursive. This answers a question of…

Let $M$ be a fixed positive integer. Let $(R_{j}(n))_{n\ge 1}$ be a linear recurrence sequence for every $j=0,1,\ldots, M$, and we set $f(n)=(R_0\circ \cdots \circ R_M)(n)$, where $(S\circ T)(n)= S(T(n))$. In this paper, we obtain…

In this paper, we find all integer sequences of the form a^n + b^n, where a and b are complex numbers and n is a nonnegative integer. We prove that if p and q are integers, then there is a correspondence between the roots of the quadratic…

We present several congruences modulo a power of prime $p$ concerning sums of the following type $\sum_{k=1}^{p-1}{m^k\over k^r}{2k\choose k}^{-1}$ which reveal some interesting connections with the analogous infinite series.

Let $\underline{a}$ and $\underline{b}$ be primitive sequences over $\mathbb{Z}/(p^e)$ with odd prime $p$ and $e\ge 2$. For certain compressing maps, we consider the distribution properties of compressing sequences of $\underline{a}$ and…

Rowland and Zeilberger devised an approach to algorithmically determine the modulo $p^r$ reductions of values of combinatorial sequences representable as constant terms (building on work of Rowland and Yassawi). The resulting $p$-schemes…

One of the most popular and studied recursive series is the Fibonacci sequence. It is challenging to see how Fibonacci numbers can be used to generate other recursive sequences. In our article, we describe some families of integer…

New iterative methods for solving linear equations are presented that are easy to use, generalize good existing methods, and appear to be faster. The new algorithms mix two kinds of linear recurrence formulas. Older methods have either high…

Let $n,k\in\mathbb{N}$ and let $p_{n}$ denote the $n$th prime number. We define $p_{n}^{(k)}$ recursively as $p_{n}^{(1)}:=p_{n}$ and $p_{n}^{(k)}=p_{p_{n}^{(k-1)}}$, that is, $p_{n}^{(k)}$ is the $p_{n}^{(k-1)}$th prime. In this note we…

Let $H(m,d)$ denote the asymptotic frequency of the natural numbers $k\equiv d \mod m$ in the continued fraction expansions of almost all numbers $x\in[0,1)$. For a fixed number $m\ge 4$, we study $\mathbb Q$-linear relations among the…

The problem of finding formulas for sums of powers of natural numbers has been of interest to mathematicians for many centuries. Among these is Faulhaber's well-known formula expressing the power sums as polynomials whose coefficients…

Let $C_n$ be the $n$th Catalan number. For any prime $p \geq 5$ we show that the set $\{C_n : n \in \mathbb{N} \}$ contains all residues mod $p$. In addition all residues are attained infinitely often. Any positive integer can be expressed…

Let $m$ be a positive integer larger than $1$, let $w$ be a finite word over $\left\{0,1,...,m-1\right\}$ and let $a_{m;w}(n)$ be the number of occurrences of the word $w$ in the $m$-expansion of $n$ mod $p$ for any non-negative integer…