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.

A300328 Triangle read by rows: row n gives the number of solutions to +-1 +- 2 +- 3 +- ... +- n == k (mod n).

Table of values

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

List of values

[2, 0, 4, 4, 2, 2, 8, 0, 8, 0, 8, 6, 6, 6, 6, 0, 20, 0, 24, 0, 20, 20, 18, 18, 18, 18, 18, 18, 64, 0, 64, 0, 64, 0, 64, 0, 60, 56, 56, 58, 56, 56, 58, 56, 56, 0, 204, 0, 204, 0, 208, 0, 204, 0, 204, 188, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.