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.

A238525 n modulo sopfr(n), where sopfr(n) is the sum of the prime factors of n, with multiplicity.

Table of values

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

List of values

[0, 0, 0, 0, 1, 0, 2, 3, 3, 0, 5, 0, 5, 7, 0, 0, 2, 0, 2, 1, 9, 0, 6, 5, 11, 0, 6, 0, 0, 0, 2, 5, 15, 11, 6, 0, 17, 7, 7, 0, 6, 0, 14, 1, 21, 0, 4, 7, 2, 11, 1, 0, 10, 7, 4, 13, 27, 0, 0, 0, 29, 11, 4, 11, 2, 0, 5, 17, 0, 0, 0, 0, 35, 10, 7, 5, 6, 0, 2, 9, 39]