A291648 - cp's OEIS frontend

A291648 a(n) is the number of simple graphs of order n having at most one cycle (such graphs are called "at most unicyclic graphs").

n	a(n)
1	1
2	2
3	4
4	9
5	19
6	45
7	105
8	261
9	657
10	1708
11	4498
12	12081
13	32752
14	89792
15	247893
16	689004
17	1924357
18	5398587
19	15197830
20	42917215
21	121507597
22	344806293
23	980423528
24	2792741331
25	7967842859
26	22765631866
27	65131178683
28	186560990191
29	53497417058
30	1535637252938

[1, 2, 4, 9, 19, 45, 105, 261, 657, 1708, 4498, 12081, 32752, 89792, 247893, 689004, 1924357, 5398587, 15197830, 42917215, 121507597, 344806293, 980423528, 2792741331, 7967842859, 22765631866, 65131178683, 186560990191, 53497417058, 1535637252938]

cp's OEIS Frontend

A291648 a(n) is the number of simple graphs of order n having at most one cycle (such graphs are called "at most unicyclic graphs").

Table of values

List of values