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.

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

Table of values

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

List of values

[2, 1, 5, 4, 5, 5, 5, 1, 14, 11, 5, 6, 5, 9, 11, 16, 5, 17, 29, 5, 11, 21, 5, 24, 20, 5, 5, 14, 29, 31, 23, 11, 50, 29, 5, 17, 17, 13, 29, 2, 5, 43, 11, 9, 65, 47, 11, 41, 74, 33, 41, 26, 5, 59, 5, 17, 14, 57, 29, 30, 95, 5, 47, 34, 11, 67, 101, 21, 29, 7, 5, 35, 17, 49, 17, 11, 41, 79, 59, 17, 2, 3, 5, 84, 131, 29, 11, 43, 29, 41, 65, 31, 47, 89, 23, 7, 41]