Number of sequences with 9 copies each of 1,2,...,n and longest increasing subsequence of length n.

A268852

Number of sequences with 9 copies each of 1,2,...,n and longest increasing subsequence of length n.

Terms

    a(0) =1a(1) =1a(2) =48619a(3) =227749730869

External references