A261192 - cp's OEIS frontend

A261192 a(0) = 2; for n>0, a(n) = smallest prime p such that p > a(n-1) and p is congruent to n modulo prime(n).

n	a(n)
0	2
1	3
2	5
3	13
4	53
5	71
6	97
7	109
8	179
9	193
10	271
11	383
12	419
13	587
14	659
15	673
16	811
17	1433
18	1543
19	1627
20	2221
21	2357
22	4051
23	4339
24	4919
25	5651
26	5783
27	6619
28	6983
29	7877
30	8053
31	11969
32	12739
33	12911
34	14629
35	15233
36	15287
37	15737
38	18131
39	18743
40	20627
41	21163
42	21943
43	22963
44	23011
45	23291
46	25717
47	26633
48	27031
49	27743

[2, 3, 5, 13, 53, 71, 97, 109, 179, 193, 271, 383, 419, 587, 659, 673, 811, 1433, 1543, 1627, 2221, 2357, 4051, 4339, 4919, 5651, 5783, 6619, 6983, 7877, 8053, 11969, 12739, 12911, 14629, 15233, 15287, 15737, 18131, 18743, 20627, 21163, 21943, 22963, 23011, 23291, 25717, 26633, 27031, 27743]

cp's OEIS Frontend

A261192 a(0) = 2; for n>0, a(n) = smallest prime p such that p > a(n-1) and p is congruent to n modulo prime(n).

Table of values

List of values