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.

A051175 Number of trees T of order n such that W(T) = W(L(L(T))) where W(G) and L(G) are the Wiener index and line graph of a graph G.

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 0
6 0
7 0
8 0
9 1
10 1
11 1
12 0
13 7
14 8
15 22
16 25
17 66
18 73
19 204
20 231
21 513
22 576
23 1520
24 1715
25 3763
26 4085

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 7, 8, 22, 25, 66, 73, 204, 231, 513, 576, 1520, 1715, 3763, 4085]