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.

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

Table of values

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

List of values

[2, 1, 5, 2, 5, 7, 5, 5, 2, 3, 5, 12, 23, 5, 11, 7, 5, 19, 5, 7, 11, 21, 5, 14, 38, 17, 23, 6, 5, 31, 23, 3, 23, 23, 5, 18, 59, 25, 5, 6, 23, 41, 11, 5, 65, 47, 11, 55, 14, 7, 77, 25, 17, 11, 23, 19, 20, 11, 5, 29, 95, 23, 47, 38, 11, 67, 23, 21, 23, 71, 5, 36, 56, 29, 59, 7, 77, 25, 11, 53]