A367288 - cp's OEIS frontend

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

n	a(n)
0	0
1	1
2	5
3	2
4	18
5	3
6	39
7	4
8	60
9	6
10	106
11	7
12	151
13	8
14	204
15	9
16	265
17	10
18	334
19	11
20	411
21	12
22	496
23	13
24	589
25	14
26	690
27	15
28	799
29	16
30	916
31	17
32	1009
33	19
34	1175
35	20
36	1316
37	21
38	1465
39	22
40	1622
41	23
42	1787
43	24
44	1960
45	25
46	2141
47	26
48	2330
49	27
50	2527
51	28
52	2732
53	29
54	2945
55	30
56	3166
57	31

[0, 1, 5, 2, 18, 3, 39, 4, 60, 6, 106, 7, 151, 8, 204, 9, 265, 10, 334, 11, 411, 12, 496, 13, 589, 14, 690, 15, 799, 16, 916, 17, 1009, 19, 1175, 20, 1316, 21, 1465, 22, 1622, 23, 1787, 24, 1960, 25, 2141, 26, 2330, 27, 2527, 28, 2732, 29, 2945, 30, 3166, 31]

cp's OEIS Frontend

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

Table of values

List of values