Combinatorial interpretations of a generalization of the Genocchi numbers.
Common terms in binary recurrences
The purpose of this paper is to prove that the common terms of linear recurrences and have at most common terms if , and have at most three common terms if where and are fixed positive integers and is a prime, such that neither nor is perfect square, further are nonzero integers satisfying the equations and .
Compression theorems for periodic tilings and consequences.
Concatenations with binary recurrent sequences.
Congruence properties of coefficients of certain algebraic power series
Congruences for and
Congruences for the Stirling numbers and associated Stirling numbers
Congruences pour les nombres de Genocchi de 2e espèce
Congruences pour les nombres de Schröder
Conjugate sequences in a Fibonacci-Lucas sense and some identities for sums of powers of their elements.
Connection between ordinary multinomials, Fibonacci numbers, Bell polynomials and discrete uniform distribution.
Continued fractions, Fibonacci numbers, and some classes of irrational numbers.
Convoluted convolved Fibonacci numbers.
Convolution of second order linear recursive sequences II.
We continue the investigation of convolutions of second order linear recursive sequences (see the first part in [1]). In this paper, we focus on the case when the characteristic polynomials of the sequences have common root.
Corrections to the paper "Quasiperfect numbers"
Corrigendum to the paper "Generalized Eulerian numbers: combinatorial applications".
Corrigendum to the paper "Periodic analogues of the Euler-Maclaurin and Poisson summation formulas with applications to number theory"
Counting functions and finite differences.
Counting Keith numbers.
Counting Maximal Distance-Independent Sets in Grid Graphs
Previous work on counting maximal independent sets for paths and certain 2-dimensional grids is extended in two directions: 3-dimensional grid graphs are included and, for some/any ℓ ∈ N, maximal distance-ℓ independent (or simply: maximal ℓ-independent) sets are counted for some grids. The transfer matrix method has been adapted and successfully applied