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.

A158974 a(n) is the number of numbers k <= n such that not all proper divisors of k are 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 3
10 3
11 5
12 1
13 6
14 5
15 6
16 6
17 9
18 6
19 10
20 7
21 10
22 11
23 13
24 7
25 14
26 14
27 15
28 14
29 18
30 12
31 19
32 16
33 19
34 20
35 21
36 16
37 24
38 23
39 24
40 20
41 27
42 22
43 28
44 25
45 25
46 29
47 31
48 23
49 32
50 30
51 33
52 32
53 36
54 31
55 36
56 32
57 38
58 39
59 41
60 31
61 42
62 41
63 39
64 40
65 44
66 41
67 47
68 44
69 47
70 43
71 50
72 40
73 51
74 50
75 49
76 50

List of values

[0, 0, 0, 0, 1, 0, 2, 1, 3, 3, 5, 1, 6, 5, 6, 6, 9, 6, 10, 7, 10, 11, 13, 7, 14, 14, 15, 14, 18, 12, 19, 16, 19, 20, 21, 16, 24, 23, 24, 20, 27, 22, 28, 25, 25, 29, 31, 23, 32, 30, 33, 32, 36, 31, 36, 32, 38, 39, 41, 31, 42, 41, 39, 40, 44, 41, 47, 44, 47, 43, 50, 40, 51, 50, 49, 50]