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.

A180865 Square array read by antidiagonals: T(m,n) is the Wiener index of the stacked book graph B(m,n) (m>=1, n>=1). B(m,n) is defined as the graph Cartesian product S(m+1) x P(n), where S(m+1) is the star graph on m+1 nodes and P(n) is the path graph on n nodes. The Wiener index of a connected graph is the sum of distances between all unordered pairs of nodes in the graph.

Table of values

n a(n)
1 1
2 4
3 8
4 9
5 25
6 25
7 16
8 52
9 72
10 56
11 25
12 89
13 145
14 154
15 105
16 36
17 136
18 244
19 304
20 280
21 176
22 49
23 193
24 369
25 506
26 545
27 459
28 273
29 64
30 260
31 520
32 760
33 900
34 884
35 700
36 400
37 81
38 337
39 697
40 1066
41 1345
42 1451
43 1337
44 1012
45 561
46 100
47 424
48 900
49 1424
50 1880
51 2160
52 2184
53 1920
54 1404
55 760

List of values

[1, 4, 8, 9, 25, 25, 16, 52, 72, 56, 25, 89, 145, 154, 105, 36, 136, 244, 304, 280, 176, 49, 193, 369, 506, 545, 459, 273, 64, 260, 520, 760, 900, 884, 700, 400, 81, 337, 697, 1066, 1345, 1451, 1337, 1012, 561, 100, 424, 900, 1424, 1880, 2160, 2184, 1920, 1404, 760]