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.

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

Table of values

n a(n)
1 1
2 1
3 2
4 1
5 4
6 3
7 1
8 6
9 8
10 5
11 1
12 9
13 21
14 20
15 5
16 1
17 12
18 45
19 68
20 28
21 8
22 1
23 16
24 87
25 205
26 142
27 56
28 7
29 1
30 20
31 159
32 549
33 620
34 355
35 64
36 11
37 1
38 25
39 270
40 1336
41 2338
42 1957
43 589
44 122
45 12
46 1
47 30
48 435
49 3000
50 7770
51 9383
52 4507
53 1250
54 150
55 14
56 1
57 36
58 676
59 6302
60 23282
61 39768
62 28783
63 11171

List of values

[1, 1, 2, 1, 4, 3, 1, 6, 8, 5, 1, 9, 21, 20, 5, 1, 12, 45, 68, 28, 8, 1, 16, 87, 205, 142, 56, 7, 1, 20, 159, 549, 620, 355, 64, 11, 1, 25, 270, 1336, 2338, 1957, 589, 122, 12, 1, 30, 435, 3000, 7770, 9383, 4507, 1250, 150, 14, 1, 36, 676, 6302, 23282, 39768, 28783, 11171]