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.

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

Table of values

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

List of values

[1, 1, 3, 4, 1, 7, 7, 5, 9, 11, 3, 5, 7, 9, 15, 8, 5, 3, 19, 7, 11, 23, 7, 24, 5, 17, 7, 14, 9, 29, 31, 11, 17, 39, 11, 2, 3, 5, 39, 19, 7, 41, 11, 29, 23, 47, 15, 55, 49, 17, 11, 25, 17, 59, 7, 3, 29, 19, 19, 30, 29, 23, 63, 29, 11, 21, 35, 23, 39, 69, 23, 36, 5, 49, 3, 23, 5, 77]