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.

A188550 Maximal number of divisors d>1 of n-k such that n-d is a multiple of k, when k runs through values 2, 3, ..., floor(sqrt(n)).

Table of values

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

List of values

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