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.

A305195 Number of z-blobs summing to n. Number of connected strict integer partitions of n, with pairwise indivisible parts, that cannot be capped by a z-tree.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 1
6 1
7 1
8 1
9 1
10 1
11 1
12 1
13 1
14 1
15 1
16 1
17 1
18 1
19 1
20 1
21 1
22 1
23 1
24 1
25 1
26 1
27 1
28 1
29 1
30 2
31 2
32 1
33 1
34 1
35 1
36 1
37 2
38 1
39 1
40 1
41 3
42 3
43 2
44 1
45 1
46 1
47 3
48 2
49 2
50 2
51 1
52 1
53 3
54 3
55 3
56 1
57 1
58 1
59 4
60 5
61 6
62 2
63 1
64 1
65 4
66 6
67 7
68 2
69 2
70 6

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 3, 2, 1, 1, 1, 3, 2, 2, 2, 1, 1, 3, 3, 3, 1, 1, 1, 4, 5, 6, 2, 1, 1, 4, 6, 7, 2, 2, 6]