login
a(n) is the number of permutations of n elements with exactly one fixed point and no transpositions.
1

%I #11 Oct 28 2024 15:57:11

%S 1,0,0,8,30,144,1120,9120,80892,808640,8908416,106889760,1389405160,

%T 19452003648,291782125440,4668506495744,79364583206160,

%U 1428562661736960,27142690917071872,542853814698737280,11399930105272855776,250798462399704792320

%N a(n) is the number of permutations of n elements with exactly one fixed point and no transpositions.

%F Equals n*A038205(n-1). - _Giovanni Resta_, Nov 13 2012

%e For n = 4 the a(4) = 8 solutions are (123), (124), (132), (134), (142), (143), (234), (243)

%Y Cf. A038205.

%Y Column k=1 of A344901.

%K nonn

%O 1,4

%A _James Mahoney_, Nov 13 2012

%E Edited by _N. J. A. Sloane_, Jan 03 2013