Triangle read by rows: T(n,k) is the number of permutations of k elements from [1..n] with longest consecutive chain size less than 3, when 1 and n are considered to be consecutive.
A340107
Triangle read by rows: T(n,k) is the number of permutations of k elements from [1..n] with longest consecutive chain size less than 3, when 1 and n are considered to be consecutive.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =2a(5) =2a(6) =1a(7) =3a(8) =6a(9) =0a(10) =1a(11) =4a(12) =12a(13) =16a(14) =16a(15) =1a(16) =5a(17) =20a(18) =50a(19) =90a(20) =80a(21) =1a(22) =6a(23) =30a(24) =108a(25) =300a(26) =552a(27) =516a(28) =1a(29) =7
External references
- oeis: A340107