Triangle read by rows: T(n,k) = number of k-classes of permutations of n letters avoiding the pattern 132 (n>=1, 0 <= k <= n-1).

A261665

Triangle read by rows: T(n,k) = number of k-classes of permutations of n letters avoiding the pattern 132 (n>=1, 0 <= k <= n-1).

Terms

    a(0) =1a(1) =2a(2) =2a(3) =4a(4) =5a(5) =5a(6) =9a(7) =12a(8) =14a(9) =14a(10) =21a(11) =30a(12) =37a(13) =42a(14) =42a(15) =51a(16) =76a(17) =99a(18) =118a(19) =132a(20) =132a(21) =127a(22) =196a(23) =265a(24) =331a(25) =387a(26) =429a(27) =429a(28) =323a(29) =512

External references