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.

A006839 Minimum of largest partial quotient of continued fraction for k/n, (k,n) = 1.

Table of values

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

List of values

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