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.

A215573 a(n) = n*(n+1)*(2n+1)/6 modulo n.

Table of values

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

List of values

[0, 1, 2, 2, 0, 1, 0, 4, 6, 5, 0, 2, 0, 7, 10, 8, 0, 3, 0, 10, 14, 11, 0, 4, 0, 13, 18, 14, 0, 5, 0, 16, 22, 17, 0, 6, 0, 19, 26, 20, 0, 7, 0, 22, 30, 23, 0, 8, 0, 25, 34, 26, 0, 9, 0, 28, 38, 29, 0, 10, 0, 31, 42, 32, 0, 11, 0, 34, 46, 35, 0, 12, 0, 37, 50, 38]