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.

A242481 a(n) = ((n*(n+1)/2) mod n + sigma(n) mod n + antisigma(n) mod n) / n.

Table of values

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

List of values

[0, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1]