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

A174076
Number of permutations of length n with no consecutive triples i,i+2,i+4 or i,i-2,i-4.
3
1, 1, 2, 6, 24, 108, 632, 4408, 35336, 319056, 3205824, 35451984, 427683560, 5588310904, 78615281768, 1184587864512, 19033796498496, 324852522308160, 5868833343451592, 111889157407344424
OFFSET
0,3
COMMENTS
Note for n<5 there are no such subsequences, so those values are trivially n!. Also note it is possible for a permutation to have both i,i+2,i+4 and i,i-2,i-4 triples, as in an example from n=7: (2,4,6,5,3,1,0). This permutation is not counted by a(7).
EXAMPLE
For n=5 there are 5!-a(5)=12 permutations with i,i+2,i+4 or i,i-2,i-4 triples. An examples of one is (4,2,0,1,3).
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Isaac Lambert, Mar 10 2010
EXTENSIONS
a(0)-a(4) and a(10)-a(19) from Alois P. Heinz, Apr 14 2021
STATUS
approved