cp's OEIS Frontend

A216726 Triangle read by rows: number of circular permutations of [1..n] with k modular progressions of rise 1, distance 2 and length 3 (n >= 3, 0 <= k <= n).

%I A216726 #7 Apr 13 2021 16:53:37
%S A216726 11,0,0,1,6,0,0,0,0,18,5,0,0,0,1,93,18,9,0,0,0,0,600,84,28,7,0,0,0,1,
%T A216726 4320,512,192,0,16,0,0,0,0,35168,4122,810,156,54,9,0,0,0,1,321630,
%U A216726 34000,5625,1400,200,0,25,0,0,0,0
%N A216726 Triangle read by rows: number of circular permutations of [1..n] with k modular progressions of rise 1, distance 2 and length 3 (n >= 3, 0 <= k <= n).
%D A216726 Wayne M. Dymacek, Isaac Lambert and Kyle Parsons, Arithmetic Progressions in Permutations, http://math.ku.edu/~ilambert/CN.pdf, 2012.
%e A216726 Triangle begins:
%e A216726 1 0 0 1
%e A216726 6 0 0 0 0
%e A216726 18 5 0 0 0 1
%e A216726 93 18 9 0 0 0 0
%e A216726 600 84 28 7 0 0 0 1
%e A216726 4320 512 192 0 16 0 0 0 0
%e A216726 35168 4122 810 156 54 9 0 0 0 1
%e A216726 321630 34000 5625 1400 200 0 25 0 0 0 0
%e A216726 ...
%Y A216726 Cf. A216716, A216718, A216719, A216722, A216724, A174075.
%K A216726 nonn,tabf
%O A216726 3,1
%A A216726 _N. J. A. Sloane_, Sep 15 2012