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.

A335102 Irregular triangle read by rows: consider the regular n-gon defined in A007678. T(n,k) (n >= 1, k >= 4+2*t where t>=0) is the number of non-boundary vertices in the n-gon at which k polygons meet.

Table of values

n a(n)
1 0
2 0
3 0
4 1
5 5
6 12
7 1
8 35
9 40
10 8
11 1
12 126
13 140
14 20
15 0
16 1
17 330
18 228
19 60
20 12
21 0
22 1
23 715
24 644
25 112
26 0
27 0
28 0
29 1
30 1365
31 1168
32 208
33 0
34 0
35 0
36 0
37 1
38 2380
39 1512
40 216
41 54
42 54
43 0
44 0
45 0
46 1
47 3876
48 3360
49 480
50 0
51 0
52 0
53 0
54 0
55 0
56 1
57 5985
58 5280
59 660
60 0
61 0
62 0
63 0
64 0
65 0
66 0
67 1
68 8855
69 6144
70 864
71 264
72 24
73 0
74 0
75 0
76 0
77 0
78 0
79 12
80 12650

List of values

[0, 0, 0, 1, 5, 12, 1, 35, 40, 8, 1, 126, 140, 20, 0, 1, 330, 228, 60, 12, 0, 1, 715, 644, 112, 0, 0, 0, 1, 1365, 1168, 208, 0, 0, 0, 0, 1, 2380, 1512, 216, 54, 54, 0, 0, 0, 1, 3876, 3360, 480, 0, 0, 0, 0, 0, 0, 1, 5985, 5280, 660, 0, 0, 0, 0, 0, 0, 0, 1, 8855, 6144, 864, 264, 24, 0, 0, 0, 0, 0, 0, 12, 12650]