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.

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

Table of values

n a(n)
1 0
2 0
3 1
4 0
5 0
6 2
7 0
8 1
9 1
10 2
11 0
12 0
13 3
14 4
15 3
16 0
17 1
18 7
19 14
20 9
21 2
22 0
23 0
24 5
25 30
26 46
27 19
28 4
29 0
30 1
31 9
32 64
33 142
34 106
35 31
36 4
37 0
38 0
39 15
40 112
41 400
42 502
43 254
44 42
45 4
46 0
47 1
48 12
49 198
50 1004
51 1914
52 1519
53 494
54 75
55 3
56 0
57 0
58 18
59 318
60 2282
61 6404
62 7589
63 3828
64 939
65 91
66 6
67 0
68 1
69 26
70 502
71 4868
72 19300

List of values

[0, 0, 1, 0, 0, 2, 0, 1, 1, 2, 0, 0, 3, 4, 3, 0, 1, 7, 14, 9, 2, 0, 0, 5, 30, 46, 19, 4, 0, 1, 9, 64, 142, 106, 31, 4, 0, 0, 15, 112, 400, 502, 254, 42, 4, 0, 1, 12, 198, 1004, 1914, 1519, 494, 75, 3, 0, 0, 18, 318, 2282, 6404, 7589, 3828, 939, 91, 6, 0, 1, 26, 502, 4868, 19300]