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.

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

Original entry on oeis.org

0, 0, 26, 744, 18475, 326446, 4292149, 43506488, 354466019, 2391684440, 13770292256, 69044240450, 307750080388, 1235903232638, 4537248102720, 15362780912768, 48489022864600, 143504551536641, 401488209735955
Offset: 1

Views

Author

R. H. Hardin Sep 20 2010

Keywords

Comments

Column 10 of A180793