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.

A261929 a(n) is the number of different pairs (p,q) mod n not of the form (x*y,x+y) mod n for any (x,y).

Table of values

n a(n)
1 0
2 1
3 3
4 8
5 10
6 18
7 21
8 36
9 45
10 55
11 55
12 96
13 78
14 112
15 135
16 160
17 136
18 216
19 171
20 280
21 273
22 286
23 253
24 408
25 350
26 403
27 432
28 560
29 406
30 630
31 465
32 656
33 693
34 697
35 805
36 1008
37 666
38 874
39 975
40 1180
41 820
42 1260
43 903
44 1408
45 1485
46 1288
47 1081
48 1728
49 1323
50 1675
51 1683
52 1976
53 1378
54 2025
55 2035
56 2352
57 2109
58 2059
59 1711
60 2880
61 1830
62 2356

List of values

[0, 1, 3, 8, 10, 18, 21, 36, 45, 55, 55, 96, 78, 112, 135, 160, 136, 216, 171, 280, 273, 286, 253, 408, 350, 403, 432, 560, 406, 630, 465, 656, 693, 697, 805, 1008, 666, 874, 975, 1180, 820, 1260, 903, 1408, 1485, 1288, 1081, 1728, 1323, 1675, 1683, 1976, 1378, 2025, 2035, 2352, 2109, 2059, 1711, 2880, 1830, 2356]