Number of sequences with 10 copies each of 1,2,...,n and longest increasing subsequence of length n.
A268853
Number of sequences with 10 copies each of 1,2,...,n and longest increasing subsequence of length n.
Terms
- a(0) =1a(1) =1a(2) =184755
External references
- oeis: A268853