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.

A316433 Number of integer partitions of n whose length is equal to the LCM of all parts.

Table of values

n a(n)
1 1
2 0
3 1
4 1
5 1
6 0
7 2
8 1
9 4
10 3
11 4
12 4
13 8
14 5
15 7
16 8
17 10
18 8
19 13
20 13
21 20
22 18
23 25
24 25
25 36
26 34
27 48
28 52
29 64
30 64
31 85
32 85
33 108
34 106
35 129
36 133
37 160
38 158
39 189
40 194
41 229
42 228
43 276
44 279
45 332
46 336
47 394
48 402
49 476
50 489
51 572
52 599
53 699
54 728
55 845
56 889
57 1032
58 1094
59 1251
60 1332
61 1523

List of values

[1, 0, 1, 1, 1, 0, 2, 1, 4, 3, 4, 4, 8, 5, 7, 8, 10, 8, 13, 13, 20, 18, 25, 25, 36, 34, 48, 52, 64, 64, 85, 85, 108, 106, 129, 133, 160, 158, 189, 194, 229, 228, 276, 279, 332, 336, 394, 402, 476, 489, 572, 599, 699, 728, 845, 889, 1032, 1094, 1251, 1332, 1523]