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.

A180773 Number of distinct solutions of Sum_{i=1..2} (x(2i-1)*x(2i)) = 0 (mod n), with x() only in 1..n-1.

Table of values

n a(n)
1 0
2 1
3 2
4 6
5 13
6 23
7 36
8 62
9 78
10 123
11 150
12 238
13 255
14 355
15 427
16 567
17 580
18 864
19 810
20 1202
21 1232
22 1471
23 1452
24 2310
25 1960
26 2479
27 2712
28 3414
29 2947
30 4649
31 3600
32 5126
33 5022
34 5673
35 5845
36 8457
37 6165
38 7975
39 8405
40 11062
41 8410
42 13133
43 9702
44 13726
45 14475
46 14323
47 12696

List of values

[0, 1, 2, 6, 13, 23, 36, 62, 78, 123, 150, 238, 255, 355, 427, 567, 580, 864, 810, 1202, 1232, 1471, 1452, 2310, 1960, 2479, 2712, 3414, 2947, 4649, 3600, 5126, 5022, 5673, 5845, 8457, 6165, 7975, 8405, 11062, 8410, 13133, 9702, 13726, 14475, 14323, 12696]