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.

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

Table of values

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

List of values

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