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.

A124593 Number of 4-indecomposable trees with n nodes.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 2
5 3
6 6
7 11
8 13
9 17
10 23
11 27
12 33
13 42
14 48
15 57
16 69
17 78
18 90
19 106
20 118
21 134
22 154
23 170
24 190
25 215
26 235
27 260
28 290
29 315
30 345
31 381
32 411
33 447
34 489
35 525
36 567
37 616
38 658
39 707
40 763
41 812
42 868
43 932
44 988
45 1052
46 1124
47 1188
48 1260
49 1341
50 1413
51 1494
52 1584
53 1665
54 1755
55 1855
56 1945

List of values

[1, 1, 1, 1, 2, 3, 6, 11, 13, 17, 23, 27, 33, 42, 48, 57, 69, 78, 90, 106, 118, 134, 154, 170, 190, 215, 235, 260, 290, 315, 345, 381, 411, 447, 489, 525, 567, 616, 658, 707, 763, 812, 868, 932, 988, 1052, 1124, 1188, 1260, 1341, 1413, 1494, 1584, 1665, 1755, 1855, 1945]

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

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