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.

A380805 Number of unlabeled simple connected graphs with n nodes of degree at most 3 and each node a member of exactly one cycle.

Table of values

n a(n)
0 1
1 0
2 0
3 1
4 1
5 1
6 2
7 2
8 3
9 4
10 7
11 10
12 18
13 27
14 49
15 81
16 147
17 256
18 476
19 858
20 1612
21 2991
22 5676
23 10729
24 20575
25 39423
26 76232
27 147602
28 287518
29 561195
30 1100190
31 2161552
32 4261059
33 8418035
34 16675006
35 33098322
36 65844566
37 131233923
38 262066375
39 524224509
40 1050414569

List of values

[1, 0, 0, 1, 1, 1, 2, 2, 3, 4, 7, 10, 18, 27, 49, 81, 147, 256, 476, 858, 1612, 2991, 5676, 10729, 20575, 39423, 76232, 147602, 287518, 561195, 1100190, 2161552, 4261059, 8418035, 16675006, 33098322, 65844566, 131233923, 262066375, 524224509, 1050414569]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.