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.

A318617 a(n) is the number of rooted labeled forests on n nodes that avoid the patterns 213, 231, and 312.

Table of values

n a(n)
0 1
1 1
2 3
3 13
4 73
5 503
6 4107
7 38773
8 415589
9 4986715
10 66238503
11 965102769
12 15306905817
13 262567910999
14 4844199561787
15 95660129298709
16 2013392566243565
17 44997370759528091
18 1064283567185090791
19 26560710262784693097
20 697529916604465424553

List of values

[1, 1, 3, 13, 73, 503, 4107, 38773, 415589, 4986715, 66238503, 965102769, 15306905817, 262567910999, 4844199561787, 95660129298709, 2013392566243565, 44997370759528091, 1064283567185090791, 26560710262784693097, 697529916604465424553]

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

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