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.

A183098 a(1) = 0, a(n) = sum of divisors d of n such that if d = Product_{i} (p_i^e_i) then not all e_i are > 1.

Table of values

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

List of values

[0, 2, 3, 2, 5, 11, 7, 2, 3, 17, 11, 23, 13, 23, 23, 2, 17, 29, 19, 37, 31, 35, 23, 47, 5, 41, 3, 51, 29, 71, 31, 2, 47, 53, 47, 41, 37, 59, 55, 77, 41, 95, 43, 79, 68, 71, 47, 95, 7, 67, 71, 93, 53, 83, 71, 107, 79, 89, 59, 163, 61, 95, 94, 2, 83, 143, 67, 121, 95, 143, 71, 65, 73, 113, 98, 135, 95, 167, 79, 157, 3, 125, 83, 219, 107, 131, 119, 167, 89, 224, 111, 163, 127, 143, 119, 191, 97, 121, 146, 87]