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.

A180781 Number of distinct solutions of sum{i=1..10}(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 18
4 756
5 18478
6 327338
7 4292145
8 43576141
9 354466005
10 2394458182
11 13770292261
12 69111228938
13 307750080438
14 1236998118274
15 4537247867399
16 15375840213938
17 48489022864504
18 143625325278096
19 401488209736317

List of values

[0, 1, 18, 756, 18478, 327338, 4292145, 43576141, 354466005, 2394458182, 13770292261, 69111228938, 307750080438, 1236998118274, 4537247867399, 15375840213938, 48489022864504, 143625325278096, 401488209736317]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.