A174073 Number of permutations of length n without modular consecutive triples i,i+2,i+4.

1, 1, 2, 3, 24, 100, 594, 4389, 35744, 325395, 3288600, 36489992, 441091944, 5770007009, 81213883898, 1223895060315, 19662509172096, 335472890422812, 6057979283966814, 115434096553014565, 2314691409661484600, 48723117262650147387, 1074208020519754180896, 24755214452825129257168

Offset

0,3

References

Wayne M. Dymacek, Isaac Lambert and Kyle Parsons, Arithmetic Progressions in Permutations, http://math.ku.edu/~ilambert/CN.pdf, 2012.

Links

Max Alekseyev, Table of n, a(n) for n = 0..100

Kyle Parsons, Arithmetic Progressions in Permutations, thesis, 2011. See Table 4 p. 12.

Example

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).

Crossrefs

Column k=0 of A216724.

Cf. A165960, A174072, A174074, A174075.

Sequence in context: A371480 A354277 A157327 * A009231 A012304 A047157

Adjacent sequences: A174070 A174071 A174072 * A174074 A174075 A174076

Keyword

nonn

Author

Isaac Lambert, Mar 06 2010

Extensions

a(11)-a(17) from Alois P. Heinz, Apr 13 2021

Terms a(18) onward from Max Alekseyev, Feb 04 2024

Status

approved