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.

A117621 Number of double-perfect partitions of [1..n].

Table of values

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

List of values

[0, 1, 1, 1, 1, 1, 3, 1, 3, 2, 3, 1, 7, 1, 3, 3, 6, 1, 8, 1, 7, 3, 3, 1, 17, 2, 3, 4, 7, 1, 13, 1, 12, 3, 3, 3, 24, 1, 3, 3, 17, 1, 13, 1, 7, 8, 3, 1, 40, 2, 8, 3, 7, 1, 20, 3, 17, 3, 3, 1, 41, 1, 3, 8, 24, 3, 13, 1, 7, 3, 13, 1, 68, 1, 3, 8, 7, 3, 13, 1, 40, 8, 3, 1, 41, 3, 3, 3, 17, 1, 44, 3, 7, 3, 3, 3]