cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A268949 Number of sequences in {1,...,2n}^(2n) with longest increasing subsequence of length n.

Table of values

n a(n)
0 1
1 3
2 175
3 23611
4 5179791
5 1583828620
6 621893381187
7 298289430051783
8 169027530016448143
9 110485582196129404780
10 81829925127960010076736

List of values

[1, 3, 175, 23611, 5179791, 1583828620, 621893381187, 298289430051783, 169027530016448143, 110485582196129404780, 81829925127960010076736]