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.

A126099 Number of 3-indecomposable (connected) graphs on n nodes.

Table of values

n a(n)
1 1
2 1
3 1
4 2
5 6
6 21
7 7
8 10
9 10
10 15
11 15
12 21
13 21
14 28
15 28
16 36
17 36
18 45
19 45
20 55
21 55
22 66
23 66
24 78
25 78
26 91
27 91
28 105
29 105
30 120
31 120
32 136
33 136
34 153
35 153
36 171
37 171
38 190
39 190
40 210
41 210
42 231
43 231
44 253
45 253
46 276
47 276
48 300
49 300
50 325
51 325
52 351
53 351
54 378
55 378
56 406
57 406
58 435
59 435
60 465
61 465
62 496

List of values

[1, 1, 1, 2, 6, 21, 7, 10, 10, 15, 15, 21, 21, 28, 28, 36, 36, 45, 45, 55, 55, 66, 66, 78, 78, 91, 91, 105, 105, 120, 120, 136, 136, 153, 153, 171, 171, 190, 190, 210, 210, 231, 231, 253, 253, 276, 276, 300, 300, 325, 325, 351, 351, 378, 378, 406, 406, 435, 435, 465, 465, 496]

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

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