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.

A267433 Number of permutations of [2n] with longest increasing subsequence of length n.

Table of values

n a(n)
0 1
1 1
2 13
3 381
4 17557
5 1100902
6 87116283
7 8312317976
8 927716186325
9 118504614869214
10 17044414451764396
11 2725298085020712539
12 479491040778079234419
13 92050364310704637832186
14 19146538134094625864605786
15 4289203871330156652985437480

List of values

[1, 1, 13, 381, 17557, 1100902, 87116283, 8312317976, 927716186325, 118504614869214, 17044414451764396, 2725298085020712539, 479491040778079234419, 92050364310704637832186, 19146538134094625864605786, 4289203871330156652985437480]