A360323 - cp's OEIS frontend

A360323 a(n) is the number of solutions to gcd(a^2 + b^2, p) = 1 where p is the n-th prime and 0 <= a,b <= p-1.

n	a(n)
1	2
2	8
3	16
4	48
5	120
6	144
7	256
8	360
9	528
10	784
11	960
12	1296
13	1600
14	1848
15	2208
16	2704
17	3480
18	3600
19	4488
20	5040
21	5184
22	6240
23	6888
24	7744
25	9216
26	10000
27	10608
28	11448
29	11664
30	12544
31	16128
32	17160
33	18496
34	19320
35	21904
36	22800
37	24336
38	26568
39	27888
40	29584
41	32040
42	32400
43	36480

[2, 8, 16, 48, 120, 144, 256, 360, 528, 784, 960, 1296, 1600, 1848, 2208, 2704, 3480, 3600, 4488, 5040, 5184, 6240, 6888, 7744, 9216, 10000, 10608, 11448, 11664, 12544, 16128, 17160, 18496, 19320, 21904, 22800, 24336, 26568, 27888, 29584, 32040, 32400, 36480]

cp's OEIS Frontend

A360323 a(n) is the number of solutions to gcd(a^2 + b^2, p) = 1 where p is the n-th prime and 0 <= a,b <= p-1.

Table of values

List of values