{"paper":{"title":"Arithmetic Properties of the Sequence of Derangements and its Generalizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Piotr Miska","submitted_at":"2015-08-09T05:40:07Z","abstract_excerpt":"The sequence of derangements is given by the formula $D_0 = 1, D_n = nD_{n-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 $a_0 = h_1(0), a_n = f(n)a_{n-1} + h_1(n)h_2(n)^n, n>0$, where $f,h_1,h_2 \\in\\mathbb{Z}[X]$, and the second one is defined by $a_n = \\sum_{j=0}^n \\frac{n!}{j!} h(n)^j, n\\in\\mathbb{N}$, where $h\\in\\mathbb{Z}[X]$. Both classes are a generalization of the sequence of derangements. We study such arithmetic properties of these sequences as: periodic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.01987","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}