|
%I #18 Feb 04 2024 18:19:29
%S 1,1,2,3,24,100,594,4389,35744,325395,3288600,36489992,441091944,
%T 5770007009,81213883898,1223895060315,19662509172096,335472890422812,
%U 6057979283966814,115434096553014565,2314691409661484600,48723117262650147387,1074208020519754180896,24755214452825129257168
%N Number of permutations of length n without modular consecutive triples i,i+2,i+4.
%D Wayne M. Dymacek, Isaac Lambert and Kyle Parsons, Arithmetic Progressions in Permutations, http://math.ku.edu/~ilambert/CN.pdf, 2012.
%H Max Alekseyev, <a href="/A174073/b174073.txt">Table of n, a(n) for n = 0..100</a>
%H Kyle Parsons, <a href="http://hdl.handle.net/11021/23093">Arithmetic Progressions in Permutations</a>, thesis, 2011. See Table 4 p. 12.
%e For example, a(5) does not count the permutation (0,4,1,3,2) since 4,1,3 is an arithmetic progression of 2 mod(5).
%Y Column k=0 of A216724.
%Y Cf. A165960, A174072, A174074, A174075.
%K nonn
%O 0,3
%A _Isaac Lambert_, Mar 06 2010
%E a(11)-a(17) from _Alois P. Heinz_, Apr 13 2021
%E Terms a(18) onward from _Max Alekseyev_, Feb 04 2024
|
