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.

A325447 Triangle read by rows: T(n,k) is the number of simple nonseparable (or 2-connected) graphs on n unlabeled nodes with circumference k, (n >= 3, k >= 3).

Table of values

n a(n)
3 1
4 0
5 3
6 0
7 2
8 8
9 0
10 2
11 6
12 48
13 0
14 2
15 9
16 74
17 383
18 0
19 2
20 10
21 159
22 756
23 6196
24 0
25 2
26 13
27 276
28 2058
29 14634
30 177083
31 0
32 2
33 14
34 505
35 4824
36 48137
37 384942
38 9305118

List of values

[1, 0, 3, 0, 2, 8, 0, 2, 6, 48, 0, 2, 9, 74, 383, 0, 2, 10, 159, 756, 6196, 0, 2, 13, 276, 2058, 14634, 177083, 0, 2, 14, 505, 4824, 48137, 384942, 9305118]