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.

A262212 Minimum number of 2's such that n*[n; 2, ..., 2, n] = [x; ..., x] for some x, where [...] denotes simple continued fractions.

Table of values

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

List of values

[1, 3, 3, 2, 3, 5, 7, 11, 5, 11, 3, 6, 5, 11, 15, 7, 11, 19, 11, 11, 11, 21, 7, 14, 13, 35, 11, 4, 11, 29, 31, 11, 7, 5, 11, 18, 19, 27, 23, 9, 11, 43, 11, 11, 21, 45, 15, 41, 29, 7, 27, 26, 35, 11, 23, 19, 9, 19, 11, 30, 29, 11, 63, 20, 11, 67, 7, 43, 5, 69, 23, 35, 37, 59, 19, 11, 27, 25, 47, 107, 9, 83, 11, 23, 43, 19, 23, 43, 11, 41, 43, 59, 45, 59, 31]