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.

A316432 Number of integer partitions of n whose length is equal to the GCD of all parts.

Table of values

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

List of values

[1, 0, 0, 1, 0, 1, 0, 1, 1, 2, 0, 2, 0, 3, 2, 3, 0, 5, 0, 3, 4, 5, 0, 8, 1, 6, 6, 6, 0, 11, 0, 8, 10, 8, 2, 18, 0, 9, 14, 15, 0, 19, 0, 16, 21, 11, 0, 34, 1, 16, 24, 24, 0, 30, 10, 27, 30, 14, 0, 71, 0, 15, 34, 38, 18, 47, 0, 47, 44, 36, 0, 88, 0, 18, 79, 63, 5]