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.

Original entry on oeis.org

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

Views

Author

R. H. Hardin Sep 20 2010

Keywords

Comments

Column 10 of A180782