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.

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

Table of values

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

List of values

[1, 1, 1, 2, 1, 5, 3, 5, 5, 9, 1, 6, 5, 5, 7, 8, 5, 19, 5, 5, 9, 23, 3, 14, 13, 17, 5, 2, 5, 31, 15, 9, 17, 5, 5, 36, 19, 13, 11, 19, 5, 43, 9, 5, 23, 45, 7, 5, 29, 17, 13, 12, 17, 29, 11, 19, 5, 59, 5, 30, 31, 5, 31, 20, 9, 65, 17, 23, 5, 13, 11, 3, 73, 29, 19, 29, 13, 79, 23, 53, 19, 81, 5, 8, 43, 5, 19, 14, 5, 41, 23, 31, 45, 59, 15, 48, 5, 29]