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.

A245903 Number of permutations of length 2n-1 avoiding 321 that can be realized on increasing binary trees.

Table of values

n	a(n)
1	1
2	2
3	10
4	79
5	753

List of values

[1, 2, 10, 79, 753]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.