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.

A180787 Number of distinct solutions of sum{i=1..5}(x(2i-1)*x(2i)) = 1 (mod n), with x() only in 1..n-1.

Table of values

n a(n)
1 0
2 1
3 5
4 64
5 400
6 1914
7 7589
8 24902
9 73134
10 188315
11 455127
12 996083
13 2098908
14 4080930
15 7790731
16 13869018
17 24527424
18 40768032
19 67955336
20 106952861
21 169909977
22 255608028
23 390623704
24 566247614
25 837326375
26 1175991196
27 1690928973

List of values

[0, 1, 5, 64, 400, 1914, 7589, 24902, 73134, 188315, 455127, 996083, 2098908, 4080930, 7790731, 13869018, 24527424, 40768032, 67955336, 106952861, 169909977, 255608028, 390623704, 566247614, 837326375, 1175991196, 1690928973]