login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Number of permutations of [n] with a fixed point but no succession.
2

%I #24 Jul 05 2021 07:08:38

%S 0,1,0,3,7,39,207,1437,11203,99041,975645,10601377,125905445,

%T 1622349059,22539777113,335845307359,5341990288103,90340567900583,

%U 1618553943500599,30623660893656205,610152486797080443,12769086757046132625

%N Number of permutations of [n] with a fixed point but no succession.

%C A succession of a permutation p is a position i such that p(i+1)-p(i) = 1.

%e For n=4 we have 1324, 1432, 2431, 3214, 3241, 4132 and 4213.

%Y Cf. A000166, A002467, A180191, A207819, A207821, A209322, A209325.

%K nonn,more

%O 0,4

%A _Jon Perry_, Jan 19 2013

%E a(11)-a(14) from _Alois P. Heinz_, Jan 20 2013

%E a(15)-a(21) from _Alois P. Heinz_, Jul 04 2021