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.

A245900 Number of permutations of [n] avoiding 321 that can be realized on increasing unary-binary trees.

Table of values

n a(n)
1 1
2 1
3 2
4 4
5 10
6 27
7 79
8 239

List of values

[1, 1, 2, 4, 10, 27, 79, 239]