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.

A180774 Number of distinct solutions of sum{i=1..3}(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 5
4 14
5 42
6 119
7 253
8 526
9 944
10 1702
11 2655
12 4510
13 6284
14 9867
15 13519
16 19980
17 25128
18 37286
19 44562
20 63802
21 76850
22 102370
23 118591
24 168208
25 183320
26 241554
27 279852
28 359754
29 387016
30 528861
31 543620
32 712450
33 780810
34 953120
35 1025355
36 1360255

List of values

[0, 0, 5, 14, 42, 119, 253, 526, 944, 1702, 2655, 4510, 6284, 9867, 13519, 19980, 25128, 37286, 44562, 63802, 76850, 102370, 118591, 168208, 183320, 241554, 279852, 359754, 387016, 528861, 543620, 712450, 780810, 953120, 1025355, 1360255]