cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A261766 a(n) is the number of partial derangements of an n-set with at least one orbit of size exactly n.

This page as a plain text file.
%I A261766 #18 Nov 17 2015 03:59:06
%S A261766 1,0,3,8,30,144,840,5760,45360,403200,3991680,43545600,518918400,
%T A261766 6706022400,93405312000,1394852659200,22230464256000,376610217984000,
%U A261766 6758061133824000,128047474114560000,2554547108585472000,53523844179886080000,1175091669949317120000
%N A261766 a(n) is the number of partial derangements of an n-set with at least one orbit of size exactly n.
%D A261766 A. Laradji and A. Umar, On the number of subpermutations with fixed orbit size, Ars Combinatoria, 109 (2013), 447-460.
%F A261766 a(n) = A261765(n,n) - A261765(n,n-1) for n>0, a(0)=1.
%e A261766 a(3) = 8 because there are 8 partial derangements on {1,2,3} with at least one orbit of size 3 namely: (1,2) --> (2,3), (1,2)  --> (3,1), (1,3)  --> (2,1), (1,3) --> (3,2), (2,3)  --> (3,1), (2,3)  --> (1,2), (1,2,3) --> (2,3,1), (1,2,3)  --> (3,1,2).
%Y A261766 Cf. A001048, A059171, A157400, A261762, A261763, A261764, A261765, A261767.
%K A261766 nonn
%O A261766 0,3
%A A261766 _Samira Stitou_, Sep 21 2015
%E A261766 More terms from _Alois P. Heinz_, Nov 04 2015