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.

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

Table of values

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

List of values

[1, 3, 1, 4, 3, 7, 3, 3, 9, 9, 3, 6, 7, 19, 7, 2, 3, 5, 9, 7, 9, 7, 3, 24, 13, 11, 7, 13, 19, 9, 15, 19, 5, 39, 3, 18, 5, 27, 19, 19, 7, 43, 9, 19, 7, 15, 7, 55, 49, 11, 13, 8, 11, 9, 7, 11, 13, 57, 19, 4, 9, 7, 31, 34, 19, 67, 5, 7, 39, 69, 3, 36, 37, 99, 5, 39, 27, 25, 39, 35, 19, 27, 7, 14, 43, 27, 19, 10, 19, 55, 7, 19, 15, 29, 15, 48, 55, 19]