267831
domain: N
Appears in sequences
- Number of successions in all the permutations p of [n] such that p(1)=1 and having no 3-sequences. A succession of a permutation p is a position i such that p(i +1) - p(i) = 1.at n=9A180187
- Triangle read by rows: number of circular permutations of [1..n] with k progressions of rise 1, distance 1 and length 3 (n >= 3, k >= 0).at n=46A216718