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.

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

Table of values

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

List of values

[2, 3, 5, 1, 11, 5, 5, 3, 5, 11, 11, 2, 5, 3, 11, 8, 11, 19, 5, 11, 11, 21, 11, 9, 2, 3, 5, 28, 11, 31, 23, 11, 8, 5, 11, 18, 59, 11, 5, 6, 11, 43, 11, 3, 65, 47, 11, 41, 29, 35, 5, 12, 11, 11, 5, 19, 86, 57, 11, 30, 95, 11, 47, 5, 11, 65, 17, 43, 5, 69, 11, 36, 56, 19, 59, 11, 11, 79, 11, 11, 20, 81, 11, 17, 131, 115, 11, 44, 11, 5, 65, 31, 47, 19, 23, 48]