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.

A350272 Triangle T(n,k), n >= 1, 0 <= k <= n-1, read by rows, where T(n,k) is the number of solutions to 1 +- 2 +- 3 +- ... +- n == k (mod n).

Table of values

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

List of values

[1, 0, 2, 2, 0, 2, 4, 0, 4, 0, 4, 4, 4, 2, 2, 0, 8, 0, 12, 0, 12, 10, 8, 10, 10, 8, 8, 10, 32, 0, 32, 0, 32, 0, 32, 0, 30, 28, 30, 28, 26, 30, 30, 26, 28, 0, 104, 0, 100, 0, 104, 0, 104, 0, 100, 94, 92, 94, 94, 92, 92, 94, 94, 92, 92, 94, 344, 0, 344, 0, 336, 0, 344, 0, 344, 0, 336, 0]

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

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