Triangle read by rows: T(n,k) is the number of permutations of n elements with k the (smallest) header (first element) of the longest descending subsequence.
A224652
Triangle read by rows: T(n,k) is the number of permutations of n elements with k the (smallest) header (first element) of the longest descending subsequence.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =2a(5) =3a(6) =1a(7) =5a(8) =8a(9) =10a(10) =1a(11) =14a(12) =25a(13) =35a(14) =45a(15) =1a(16) =42a(17) =89a(18) =141a(19) =196a(20) =251a(21) =1a(22) =132a(23) =357a(24) =644a(25) =966a(26) =1302a(27) =1638a(28) =1a(29) =429
External references
- oeis: A224652