2015/08/09 by Miska, Piotr
#11B50 #11B83 #Combinatorics (math.CO) #FOS: Mathematics #Number Theory (math.NT)
paper · doi:10.48550/arxiv.1508.01987
The sequence of derangements is given by the formula D0 = 1, Dn = nDn-1 + (-1)n, n>0. It is a classical object appearing in combinatorics and number theory. In this paper we consider two classes of sequences: first class is given by the formulae a0 = h1(0), an = f(n)an-1 + h1(n)h2(n)n, n>0, where f,h1,h2 ∈ℤ[X], and the second one is defined by an = ∑j=0n (n!)/(j!) h(n)j, n∈ℕ, where h∈ℤ[X]. Both classes are a generalization of the sequence of derangements. We study such arithmetic properties of these sequences as: periodicity modulo d, where d∈ℕ+, p-adic valuations, asymptotics, boundedness, periodicity, recurrence relations and prime divisors. Particularly we focus on the properties of the sequence of derangements and use them to establish arithmetic properties of the sequences of even and odd derangements.