Number of sequences with n copies each of 1,2,...,n and longest increasing subsequence of length n.
A268485
Number of sequences with n copies each of 1,2,...,n and longest increasing subsequence of length n.
Terms
- a(0) =1a(1) =1a(2) =5a(3) =1306a(4) =46922017
External references
- oeis: A268485