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.

A180575 Triangle read by rows: T(n,k) is the number of unordered pairs of nodes at distance k in the prism graph C_n X P_3 with the edges of the outer cycle removed (called a web graph). Equivalently, the graph is obtained by attaching a pendant edge to each node of the outer cycle of the circular ladder (prism) C_n X P_2. C_n denotes the cycle graph on n nodes and P_n denotes the path graph on n nodes.

Table of values

n a(n)
3 12
4 15
5 9
6 16
7 24
8 20
9 6
10 20
11 35
12 35
13 15
14 24
15 42
16 48
17 30
18 9
19 28
20 49
21 63
22 49
23 21
24 32
25 56
26 72
27 64
28 40
29 12
30 36
31 63
32 81
33 81
34 63
35 27
36 40
37 70
38 90
39 90
40 80
41 50
42 15
43 44
44 77
45 99
46 99
47 99
48 77
49 33
50 48
51 84
52 108
53 108
54 108
55 96
56 60
57 18
58 52
59 91
60 117
61 117
62 117
63 117
64 91
65 39
66 56
67 98
68 126
69 126

List of values

[12, 15, 9, 16, 24, 20, 6, 20, 35, 35, 15, 24, 42, 48, 30, 9, 28, 49, 63, 49, 21, 32, 56, 72, 64, 40, 12, 36, 63, 81, 81, 63, 27, 40, 70, 90, 90, 80, 50, 15, 44, 77, 99, 99, 99, 77, 33, 48, 84, 108, 108, 108, 96, 60, 18, 52, 91, 117, 117, 117, 117, 91, 39, 56, 98, 126, 126]