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.

A341856 Array read by antidiagonals: T(n,k) is the number of rooted strong triangulations of a disk with n interior nodes and 3+k nodes on the boundary.

Table of values

n a(n)
0 1
1 0
2 1
3 0
4 1
5 3
6 0
7 1
8 6
9 13
10 0
11 1
12 10
13 36
14 68
15 0
16 1
17 15
18 80
19 228
20 399
21 0
22 1
23 21
24 155
25 610
26 1518
27 2530
28 0
29 1
30 28
31 273
32 1410
33 4625
34 10530
35 16965
36 0
37 1
38 36
39 448
40 2933
41 12165
42 35322
43 75516
44 118668
45 0
46 1
47 45
48 696
49 5628
50 28707
51 102548
52 272800
53 556512
54 857956

List of values

[1, 0, 1, 0, 1, 3, 0, 1, 6, 13, 0, 1, 10, 36, 68, 0, 1, 15, 80, 228, 399, 0, 1, 21, 155, 610, 1518, 2530, 0, 1, 28, 273, 1410, 4625, 10530, 16965, 0, 1, 36, 448, 2933, 12165, 35322, 75516, 118668, 0, 1, 45, 696, 5628, 28707, 102548, 272800, 556512, 857956]