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.

A380591 a(n) is the number of dissections of a convex (n+2)-sided polygon by nonintersecting diagonals into triangles and quadrilaterals such that at least one of the dividing diagonals passes through a chosen vertex.

Table of values

n a(n)
1 0
2 1
3 5
4 21
5 90
6 395
7 1773
8 8110
9 37686
10 177450
11 844935
12 4061762
13 19687020
14 96107358
15 472132330
16 2332304055
17 11578595554
18 57736664825
19 289055592810
20 1452381167325
21 7321620080550
22 37020073600755
23 187699184460450
24 954084756674088
25 4861008765722340

List of values

[0, 1, 5, 21, 90, 395, 1773, 8110, 37686, 177450, 844935, 4061762, 19687020, 96107358, 472132330, 2332304055, 11578595554, 57736664825, 289055592810, 1452381167325, 7321620080550, 37020073600755, 187699184460450, 954084756674088, 4861008765722340]