|
|
A174073
|
|
Number of permutations of length n without modular consecutive triples i,i+2,i+4.
|
|
7
|
|
|
1, 1, 2, 3, 24, 100, 594, 4389, 35744, 325395, 3288600, 36489992, 441091944, 5770007009, 81213883898, 1223895060315, 19662509172096, 335472890422812, 6057979283966814, 115434096553014565, 2314691409661484600, 48723117262650147387, 1074208020519754180896, 24755214452825129257168
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
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
|
|
|
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
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|