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.

A089641 Number of k, 1<=k<=n, such that the number of elements in the continued fraction for n/k is maximum.

Table of values

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

List of values

[1, 2, 1, 1, 1, 2, 2, 1, 2, 2, 2, 1, 1, 2, 1, 2, 4, 2, 2, 3, 1, 4, 2, 5, 3, 3, 2, 2, 2, 1, 2, 2, 4, 1, 2, 4, 2, 4, 1, 1, 4, 1, 2, 2, 3, 2, 2, 1, 2, 2, 4, 2, 4, 8, 1, 1, 5, 2, 4, 2, 8, 6, 5, 2, 1, 2, 2, 3, 2, 3, 4, 1, 3, 1, 2, 2, 7, 5, 2, 1, 2, 2, 2, 8, 2, 2, 4, 2, 1, 5, 2, 4, 4, 4, 2, 6, 2, 8, 2, 6, 6, 1, 2, 2, 2]