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.

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

Table of values

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

List of values

[1, 3, 3, 1, 3, 7, 7, 11, 1, 9, 3, 12, 7, 3, 15, 3, 11, 17, 3, 7, 9, 21, 7, 9, 25, 35, 7, 14, 3, 31, 31, 19, 3, 7, 11, 8, 17, 51, 7, 20, 7, 43, 19, 11, 21, 47, 15, 55, 9, 3, 51, 8, 35, 9, 7, 35, 29, 57, 3, 30, 31, 23, 63, 25, 19, 21, 3, 43, 7, 71, 23, 36, 17, 19, 35, 39, 51, 77, 15, 107, 41, 81, 7, 3, 43, 59, 39, 44, 11, 103, 43, 31, 47, 17, 31, 48, 55, 59]