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.

A180776 Number of distinct solutions of sum{i=1..5}(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 7
4 62
5 402
6 1960
7 7587
8 25470
9 73146
10 193036
11 455161
12 1022770
13 2098782
14 4196208
15 7797217
16 14286908
17 24527232
18 42125055
19 67955391
20 110571248
21 170260213
22 264585538
23 390623343
24 588725404
25 837466268
26 1220597598
27 1696535256

List of values

[0, 0, 7, 62, 402, 1960, 7587, 25470, 73146, 193036, 455161, 1022770, 2098782, 4196208, 7797217, 14286908, 24527232, 42125055, 67955391, 110571248, 170260213, 264585538, 390623343, 588725404, 837466268, 1220597598, 1696535256]