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.

A180782 T(n,k)=number of distinct solutions of sum{i=1..k}(x(2i-1)*x(2i)) = 0 (mod n), with x() only in 1..n-1.

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 1
6 0
7 0
8 0
9 2
10 1
11 0
12 1
13 5
14 6
15 0
16 0
17 0
18 3
19 14
20 13
21 2
22 0
23 1
24 7
25 34
26 42
27 23
28 0
29 0
30 0
31 12
32 62
33 145
34 119
35 36
36 3
37 0
38 1
39 9
40 118
41 402
42 522
43 253
44 62
45 3
46 0
47 0
48 15
49 198
50 995
51 1960
52 1518
53 526
54 78
55 4
56 0
57 1
58 22
59 327
60 2294
61 6518
62 7587
63 4041
64 944
65 123
66 0
67 0
68 0
69 18
70 499
71 4856
72 19467
73 32893

List of values

[0, 0, 0, 0, 1, 0, 0, 0, 2, 1, 0, 1, 5, 6, 0, 0, 0, 3, 14, 13, 2, 0, 1, 7, 34, 42, 23, 0, 0, 0, 12, 62, 145, 119, 36, 3, 0, 1, 9, 118, 402, 522, 253, 62, 3, 0, 0, 15, 198, 995, 1960, 1518, 526, 78, 4, 0, 1, 22, 327, 2294, 6518, 7587, 4041, 944, 123, 0, 0, 0, 18, 499, 4856, 19467, 32893]