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.

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

Table of values

n a(n)
1 0
2 1
3 3
4 14
5 46
6 106
7 254
8 494
9 939
10 1528
11 2668
12 3958
13 6334
14 8641
15 13239
16 17240
17 25227
18 31128
19 44660
20 53786
21 74111
22 86712
23 118779
24 134632
25 181755
26 202431
27 266175
28 296323
29 387533
30 412008
31 544121
32 582432
33 736568
34 786710
35 1006750
36 1037604
37 1336781

List of values

[0, 1, 3, 14, 46, 106, 254, 494, 939, 1528, 2668, 3958, 6334, 8641, 13239, 17240, 25227, 31128, 44660, 53786, 74111, 86712, 118779, 134632, 181755, 202431, 266175, 296323, 387533, 412008, 544121, 582432, 736568, 786710, 1006750, 1037604, 1336781]