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.

A089831 Triangle T(n,m) (read as T(1,1); T(2,1), T(2,2); T(3,1), T(3,2), T(3,3);) Number of distinct non-recursive Catalan Automorphisms whose minimum clause-representation requires examination of n nodes in total, divided into m non-default clauses.

Table of values

n a(n)
1 1
2 10
3 0
4 115
5 10
6 0
7 1666
8 139
9 0
10 0
11 30198
12 2570
13 0
14 0
15 0
16 665148
17 47878
18 904
19 0
20 0
21 0
22 17296851
23 1017174
24 20972
25 0
26 0
27 0
28 0

List of values

[1, 10, 0, 115, 10, 0, 1666, 139, 0, 0, 30198, 2570, 0, 0, 0, 665148, 47878, 904, 0, 0, 0, 17296851, 1017174, 20972, 0, 0, 0, 0]

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

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