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.

A282749 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_i, x_j) = 1 for all i != j (where 1<=k<=n).

Table of values

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

List of values

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