Number of sequences with 8 copies each of 1,2,...,n and longest increasing subsequence of length n.
A268851
Number of sequences with 8 copies each of 1,2,...,n and longest increasing subsequence of length n.
Terms
- a(0) =1a(1) =1a(2) =12869a(3) =9450343019
External references
- oeis: A268851