A250069 - cp's OEIS frontend

A250069 a(n) = n^2 mod gpf(n^2 + 1) where gpf(k) is the greatest prime dividing k.

n	a(n)
1	1
2	4
3	4
4	16
5	12
6	36
7	4
8	12
9	40
10	100
11	60
12	28
13	16
14	196
15	112
16	256
17	28
18	12
19	180
20	400
21	16
22	96
23	52
24	576
25	312
26	676
27	72
28	156
29	420
30	52
31	36
32	40
33	108
34	88
35	612
36	1296
37	136
38	16
39	760
40	1600
41	28
42	352
43	36
44	148
45	1012
46	72
47	16
48	460
49	1200
50	60
51	1300
52	540
53	280
54	2916
55	88
56	3136
57	12

[1, 4, 4, 16, 12, 36, 4, 12, 40, 100, 60, 28, 16, 196, 112, 256, 28, 12, 180, 400, 16, 96, 52, 576, 312, 676, 72, 156, 420, 52, 36, 40, 108, 88, 612, 1296, 136, 16, 760, 1600, 28, 352, 36, 148, 1012, 72, 16, 460, 1200, 60, 1300, 540, 280, 2916, 88, 3136, 12]

cp's OEIS Frontend

A250069 a(n) = n^2 mod gpf(n^2 + 1) where gpf(k) is the greatest prime dividing k.

Table of values

List of values