Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having exactly k entries that are midpoints of 321 patterns (0 <= k <= n-2 for n >= 2; k=0 for n=1).

A145879

Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having exactly k entries that are midpoints of 321 patterns (0 <= k <= n-2 for n >= 2; k=0 for n=1).

Terms

    a(0) =1a(1) =2a(2) =5a(3) =1a(4) =14a(5) =8a(6) =2a(7) =42a(8) =46a(9) =26a(10) =6a(11) =132a(12) =232a(13) =220a(14) =112a(15) =24a(16) =429a(17) =1093a(18) =1527a(19) =1275a(20) =596a(21) =120a(22) =1430a(23) =4944a(24) =9436a(25) =11384a(26) =8638a(27) =3768a(28) =720a(29) =4862

External references