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.

A003165 a(n) = floor(n/2) + 1 - d(n), where d(n) is the number of divisors of n.

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 1
6 0
7 2
8 1
9 2
10 2
11 4
12 1
13 5
14 4
15 4
16 4
17 7
18 4
19 8
20 5
21 7
22 8
23 10
24 5
25 10
26 10
27 10
28 9
29 13
30 8
31 14
32 11
33 13
34 14
35 14
36 10
37 17
38 16
39 16
40 13
41 19
42 14
43 20
44 17
45 17
46 20
47 22
48 15
49 22
50 20
51 22
52 21
53 25
54 20
55 24
56 21
57 25
58 26
59 28
60 19
61 29
62 28
63 26
64 26
65 29
66 26
67 32
68 29
69 31
70 28
71 34
72 25
73 35
74 34
75 32

List of values

[0, 0, 0, 0, 1, 0, 2, 1, 2, 2, 4, 1, 5, 4, 4, 4, 7, 4, 8, 5, 7, 8, 10, 5, 10, 10, 10, 9, 13, 8, 14, 11, 13, 14, 14, 10, 17, 16, 16, 13, 19, 14, 20, 17, 17, 20, 22, 15, 22, 20, 22, 21, 25, 20, 24, 21, 25, 26, 28, 19, 29, 28, 26, 26, 29, 26, 32, 29, 31, 28, 34, 25, 35, 34, 32]