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.

A180801 Number of distinct solutions of sum{i=1..9}(x(2i-1)*x(2i)) = 0 (mod n), with x() in 0..n-1.

Table of values

n a(n)
1 1
2 30
3 676
4 12502
5 163480
6 1687310
7 13449091
8 89142751
9 492505059
10 2376231744
11 10047650419
12 38448350058
13 133156230854
14 427570371184
15 1270967124805
16 3561662099758
17 9383313309748
18 23597905122682
19 56409558588283

List of values

[1, 30, 676, 12502, 163480, 1687310, 13449091, 89142751, 492505059, 2376231744, 10047650419, 38448350058, 133156230854, 427570371184, 1270967124805, 3561662099758, 9383313309748, 23597905122682, 56409558588283]