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.

A333275 Irregular triangle read by rows: consider the graph defined in A306302 formed from a row of n adjacent congruent rectangles by drawing the diagonals of all visible rectangles; T(n,k) (n >= 1, 2 <= k <= 2n+2) is the number of non-boundary vertices in the graph at which k polygons meet.

Table of values

n a(n)
1 0
2 0
3 1
4 0
5 0
6 6
7 0
8 1
9 0
10 0
11 24
12 0
13 2
14 0
15 1
16 0
17 0
18 54
19 0
20 8
21 0
22 2
23 0
24 1
25 0
26 0
27 124
28 0
29 18
30 0
31 2
32 0
33 2
34 0
35 1
36 0
37 0
38 214
39 0
40 32
41 0
42 10
43 0
44 2
45 0
46 2
47 0
48 1
49 0
50 0
51 382
52 0
53 50
54 0
55 22
56 0
57 2
58 0
59 2
60 0
61 2
62 0
63 1
64 0
65 0
66 598
67 0
68 102
69 0
70 18
71 0
72 12
73 0
74 2
75 0
76 2
77 0
78 2
79 0
80 1

List of values

[0, 0, 1, 0, 0, 6, 0, 1, 0, 0, 24, 0, 2, 0, 1, 0, 0, 54, 0, 8, 0, 2, 0, 1, 0, 0, 124, 0, 18, 0, 2, 0, 2, 0, 1, 0, 0, 214, 0, 32, 0, 10, 0, 2, 0, 2, 0, 1, 0, 0, 382, 0, 50, 0, 22, 0, 2, 0, 2, 0, 2, 0, 1, 0, 0, 598, 0, 102, 0, 18, 0, 12, 0, 2, 0, 2, 0, 2, 0, 1]