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.

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

Table of values

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

List of values

[2, 4, 0, 0, 4, 4, 8, 0, 8, 0, 8, 4, 8, 8, 4, 32, 0, 16, 0, 16, 0, 24, 24, 16, 12, 12, 16, 24, 64, 0, 64, 0, 64, 0, 64, 0, 40, 72, 60, 44, 60, 60, 44, 60, 72, 224, 0, 208, 0, 192, 0, 192, 0, 208, 0, 176, 188, 188, 180, 196, 184, 184, 196, 180, 188, 188]

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

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