A134162 - cp's OEIS frontend

A134162 Let S(k) be the sequence s() defined by s(1) = k; for i > 1, s(i) = s(i-1) + gcd(s(i-1), i). Start with the list of positive integers and remove any k's for which S(k) merges with an S(m) with m < k. Each value k > 1 is conjectural.

n	a(n)
1	1
2	2
3	4
4	8
5	16
6	20
7	44
8	92
9	110
10	136
11	152
12	170
13	172
14	188
15	200
16	212
17	236
18	242
19	256
20	272
21	316
22	332
23	368
24	440
25	488
26	500
27	590
28	616
29	620
30	632
31	650
32	676
33	704
34	710
35	742
36	788
37	824
38	848
39	892
40	946
41	952
42	968
43	1010
44	1034
45	1036
46	1052
47	1058
48	1088
49	1118

[1, 2, 4, 8, 16, 20, 44, 92, 110, 136, 152, 170, 172, 188, 200, 212, 236, 242, 256, 272, 316, 332, 368, 440, 488, 500, 590, 616, 620, 632, 650, 676, 704, 710, 742, 788, 824, 848, 892, 946, 952, 968, 1010, 1034, 1036, 1052, 1058, 1088, 1118]

cp's OEIS Frontend

A134162 Let S(k) be the sequence s() defined by s(1) = k; for i > 1, s(i) = s(i-1) + gcd(s(i-1), i). Start with the list of positive integers and remove any k's for which S(k) merges with an S(m) with m < k. Each value k > 1 is conjectural.

Table of values

List of values