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.

A256067 Irregular table T(n,k): the number of partitions of n where the least common multiple of all parts equals k.

Table of values

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

List of values

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