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.

A352996 a(n) = n*(n+1)/2 mod (sum (with multiplicity) of prime factors of n).

Table of values

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

List of values

[1, 0, 2, 0, 1, 0, 0, 3, 6, 0, 1, 0, 6, 0, 0, 0, 3, 0, 3, 1, 6, 0, 3, 5, 6, 0, 10, 0, 5, 0, 8, 1, 6, 6, 6, 0, 6, 12, 6, 0, 3, 0, 0, 1, 6, 0, 10, 7, 3, 6, 1, 0, 0, 4, 10, 3, 6, 0, 6, 0, 6, 1, 4, 3, 3, 0, 15, 23, 7, 0, 0, 0, 6, 3, 5, 15, 3, 0, 3, 9, 6, 0, 0, 3, 6, 20, 6, 0, 0, 6, 12, 19, 6, 0, 2, 0]