Number of permutations of length n with longest increasing subsequence of length 9.
A245665
Number of permutations of length n with longest increasing subsequence of length 9.
Terms
- a(0) =1a(1) =81a(2) =3961a(3) =153341a(4) =5213287a(5) =164060352a(6) =4927007100a(7) =143938455225
External references
- oeis: A245665