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.

Table of values

n a(n)
1 0
2 0
3 26
4 744
5 18475
6 326446
7 4292149
8 43506488
9 354466019
10 2391684440
11 13770292256
12 69044240450
13 307750080388
14 1235903232638
15 4537248102720
16 15362780912768
17 48489022864600
18 143504551536641
19 401488209735955

List of values

[0, 0, 26, 744, 18475, 326446, 4292149, 43506488, 354466019, 2391684440, 13770292256, 69044240450, 307750080388, 1235903232638, 4537248102720, 15362780912768, 48489022864600, 143504551536641, 401488209735955]

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

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