36489992
domain: N
Appears in sequences
- Number of permutations of length n without modular 3-sequences.at n=11A165960
- Number of permutations of length n without modular consecutive triples i,i+2,i+4.at n=11A174073
- Triangle read by rows: T(n,k) is the number of permutations of [1..n] with k modular progressions of rise 2, distance 1 and length 3 (n >= 0, k >= 0).at n=43A216724