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.

A233573 Number of ways n can be partitioned as A233010(i)+A233572(j), where i,j >= 1.

Table of values

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

List of values

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