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.

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

Table of values

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

List of values

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