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.

A188795 a(n) counts all integers k in [2,floor(sqrt(n))] such that the number of divisors d>1 of n-k with k|(n-d) equals A188550(n).

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 1, 1, 2, 1, 1, 2, 2, 1, 1, 2, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 1, 1, 1, 1, 1, 1, 3, 2, 1, 1, 1, 1, 1, 1, 6, 1, 1, 1, 1, 1, 3, 1, 2, 2, 3, 2, 1, 1, 1, 1, 1, 1, 4, 2, 2, 1, 1, 1, 1, 1, 1, 2, 3, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1]