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.

A281527 Triangle read by rows: T(n,k) = minimal number of terms needed to write k/n as a signed sum of distinct unit fractions, 1 <= k < n.

Table of values

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

List of values

[1, 1, 2, 1, 1, 2, 1, 2, 2, 2, 1, 1, 1, 2, 2, 1, 2, 2, 2, 3, 2, 1, 1, 2, 1, 2, 2, 2, 1, 2, 1, 2, 2, 2, 3, 2, 1, 1, 2, 2, 1, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 3, 3, 3, 2, 1, 1, 1, 1, 2, 1, 2, 2, 2, 2, 2, 1, 2, 2, 2, 3, 2, 2, 3, 3, 3, 3, 2, 1, 1, 2, 2, 2, 2, 1, 2, 2, 3, 3, 2, 2, 1, 2, 1, 2, 1, 2, 2, 2, 2, 2, 3, 2, 3, 2]