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.

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

Table of values

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

List of values

[1, 3, 1, 2, 3, 7, 1, 11, 5, 3, 3, 2, 7, 11, 3, 16, 11, 17, 5, 7, 3, 23, 3, 14, 5, 35, 7, 14, 11, 31, 7, 3, 33, 23, 11, 18, 17, 11, 5, 20, 7, 41, 3, 11, 23, 45, 3, 55, 29, 67, 5, 25, 35, 11, 7, 35, 29, 57, 11, 30, 31, 23, 15, 2, 3, 5, 33, 23, 23, 71, 11, 36, 37, 59, 17, 7, 11, 15, 11, 107, 41, 81, 7, 50, 41, 59, 3, 43, 11, 23, 23, 31, 45, 17, 7, 48, 55, 11]