A367290 - cp's OEIS frontend

A367290 Lexicographically earliest sequence of distinct positive integers such that for any n > 0, a(n) and a(n+1) are congruent modulo the n-th prime number, and the least value not yet in the sequence appears as soon as possible.

n	a(n)
1	1
2	5
3	2
4	17
5	3
6	69
7	4
8	310
9	6
10	558
11	7
12	193
13	8
14	869
15	9
16	2077
17	10
18	1780
19	11
20	3562
21	12
22	961
23	13
24	6155
25	14
26	2439
27	15
28	8255
29	16
30	6120
31	18
32	12464
33	19
34	9472
35	20
36	11195
37	21
38	4260
39	22
40	24070
41	23
42	16133
43	24
44	18360
45	25
46	19528
47	26
48	27456
49	27
50	25905
51	28
52	46395
53	29
54	6054

[1, 5, 2, 17, 3, 69, 4, 310, 6, 558, 7, 193, 8, 869, 9, 2077, 10, 1780, 11, 3562, 12, 961, 13, 6155, 14, 2439, 15, 8255, 16, 6120, 18, 12464, 19, 9472, 20, 11195, 21, 4260, 22, 24070, 23, 16133, 24, 18360, 25, 19528, 26, 27456, 27, 25905, 28, 46395, 29, 6054]

cp's OEIS Frontend

A367290 Lexicographically earliest sequence of distinct positive integers such that for any n > 0, a(n) and a(n+1) are congruent modulo the n-th prime number, and the least value not yet in the sequence appears as soon as possible.

Table of values

List of values