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.

A305194 Number of z-forests summing to n. Number of strict integer partitions of n with pairwise indivisible parts and all connected components having clutter density -1.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 2
6 1
7 3
8 2
9 3
10 4
11 5
12 4
13 6
14 7
15 7
16 9
17 11
18 12
19 13
20 15
21 17
22 20
23 23
24 25
25 27
26 32
27 35
28 40
29 45
30 49
31 54
32 58
33 67
34 78
35 82
36 95
37 99
38 111
39 123
40 135
41 150
42 164
43 177
44 194
45 214
46 236
47 260
48 282
49 309
50 330

List of values

[1, 1, 1, 1, 2, 1, 3, 2, 3, 4, 5, 4, 6, 7, 7, 9, 11, 12, 13, 15, 17, 20, 23, 25, 27, 32, 35, 40, 45, 49, 54, 58, 67, 78, 82, 95, 99, 111, 123, 135, 150, 164, 177, 194, 214, 236, 260, 282, 309, 330]