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.

A245899 a(n) is the number of permutations avoiding 312 that can be realized on increasing unary-binary trees with n nodes.

Table of values

n a(n)
1 1
2 1
3 2
4 3
5 7
6 14
7 37
8 80

List of values

[1, 1, 2, 3, 7, 14, 37, 80]