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.

A158976 a(n) = sum 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 4
6 0
7 10
8 6
9 18
10 23
11 37
12 10
13 49
14 45
15 54
16 66
17 94
18 75
19 112
20 90
21 123
22 149
23 175
24 120
25 199
26 220
27 241
28 251
29 305
30 236
31 335
32 307
33 358
34 396
35 409
36 385
37 505
38 501
39 534
40 499
41 622
42 568
43 664
44 630
45 632
46 749
47 799
48 688
49 847
50 857
51 937
52 959
53 1049
54 985
55 1078
56 1039
57 1205

List of values

[0, 0, 0, 0, 4, 0, 10, 6, 18, 23, 37, 10, 49, 45, 54, 66, 94, 75, 112, 90, 123, 149, 175, 120, 199, 220, 241, 251, 305, 236, 335, 307, 358, 396, 409, 385, 505, 501, 534, 499, 622, 568, 664, 630, 632, 749, 799, 688, 847, 857, 937, 959, 1049, 985, 1078, 1039, 1205]