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.

A282750 Triangle read by rows: T(n,k) is the number of partitions of n into k parts x_1, x_2, ..., x_k such that gcd(x_1, x_2, ..., x_k) = 1 (where 1 <= k <= n).

Table of values

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

List of values

[1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 2, 2, 1, 1, 0, 1, 2, 2, 1, 1, 0, 3, 4, 3, 2, 1, 1, 0, 2, 4, 4, 3, 2, 1, 1, 0, 3, 6, 6, 5, 3, 2, 1, 1, 0, 2, 6, 8, 6, 5, 3, 2, 1, 1, 0, 5, 10, 11, 10, 7, 5, 3, 2, 1, 1, 0, 2, 8, 12, 12, 10, 7, 5, 3, 2, 1, 1, 0, 6, 14, 18, 18, 14]