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.

A245904 a(n) is the number of permutations avoiding 231 and 312 realizable on increasing strict binary trees with 2n-1 nodes.

Table of values

n a(n)
1 1
2 2
3 6
4 22
5 84
6 330
7 1308
8 5210
9 20796
10 83100
11 332232
12 1328598
13 5313732
14 21253620
15 85011864
16 340042246
17 1360158564

List of values

[1, 2, 6, 22, 84, 330, 1308, 5210, 20796, 83100, 332232, 1328598, 5313732, 21253620, 85011864, 340042246, 1360158564]