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.

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

Table of values

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

List of values

[2, 3, 5, 2, 11, 1, 5, 11, 2, 9, 11, 5, 5, 11, 11, 3, 11, 19, 5, 3, 29, 7, 11, 2, 5, 35, 5, 6, 11, 31, 23, 19, 11, 5, 11, 8, 59, 11, 5, 20, 11, 13, 29, 11, 23, 45, 11, 13, 2, 3, 5, 52, 35, 29, 5, 19, 20, 57, 11, 30, 95, 11, 47, 5, 59, 67, 11, 7, 5, 23, 11, 36, 8, 11, 59, 9, 11, 79, 11, 107, 20, 27, 11, 11, 41, 27, 29, 43, 11, 5, 23, 31, 137, 59, 23, 47, 41, 59]