23 citations · 24 across the 2 of their papers we have counts for
Showing math.NTShow all
2 papers · 1 filter
math.NT2018★ 23 cited
The -derangement numbers
Chenying Wang, Piotr Miska, István Mező
The classical derangement numbers count fixed point-free permutations. In this paper we study the enumeration problem of generalized derangements, when some of the elements are res…
math.NT2008★ 1 cited
A Symmetric Algorithm for Hyperharmonic and Fibonacci Numbers
Ayhan Dil, Istvan Mezo
In this work, we introduce a symmetric algorithm obtained by the recurrence relation a_{n}^{k}=a_{n-1}^{k}+a_{n}^{k-1}. We point out that this algorithm can be apply to hyperharmon…