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.

A360031 a(n) is the number of unlabeled 2-connected graphs with n edges containing at least one pair of nodes with resistance distance 1 when all edges are replaced by unit resistors.

Table of values

n a(n)
3 0
4 1
5 1
6 1
7 2
8 5
9 14
10 35
11 111
12 341
13 1130
14 3969
15 15002
16 58429
17 239045
18 1012241

List of values

[0, 1, 1, 1, 2, 5, 14, 35, 111, 341, 1130, 3969, 15002, 58429, 239045, 1012241]