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.

A365641 The minimum number of ways to label each triangle of a triangulation of an n-gon with one of its vertices so that different triangles get different labels (minimum taken over all triangulations).

Table of values

n a(n)
2 1
3 3
4 7
5 14
6 25
7 41
8 63
9 92
10 128
11 173
12 228
13 293
14 369
15 458
16 561
17 676
18 807
19 955
20 1119
21 1300

List of values

[1, 3, 7, 14, 25, 41, 63, 92, 128, 173, 228, 293, 369, 458, 561, 676, 807, 955, 1119, 1300]

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

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