A346268 - cp's OEIS frontend

A346268 a(n) is the smallest positive number not yet in a(0..n-1) such that the absolute differences of order k = 1 .. n-1 of a(0..n) contain a maximum of k-1 duplicate values. We define a(0) = 1.

n	a(n)
0	1
1	2
2	4
3	7
4	12
5	3
6	9
7	20
8	40
9	36
10	5
11	26
12	18
13	47
14	115
15	13
16	6
17	19
18	44
19	94
20	193
21	87
22	60
23	48
24	84
25	170
26	355
27	31
28	14
29	63
30	25
31	119
32	71
33	187
34	444
35	34
36	8
37	42
38	98
39	211
40	450
41	100
42	10
43	62
44	132
45	116
46	274
47	763
48	50
49	22
50	73
51	244
52	792
53	92
54	1502
55	5433
56	27
57	17
58	41
59	117
60	77
61	206
62	540
63	1315

[1, 2, 4, 7, 12, 3, 9, 20, 40, 36, 5, 26, 18, 47, 115, 13, 6, 19, 44, 94, 193, 87, 60, 48, 84, 170, 355, 31, 14, 63, 25, 119, 71, 187, 444, 34, 8, 42, 98, 211, 450, 100, 10, 62, 132, 116, 274, 763, 50, 22, 73, 244, 792, 92, 1502, 5433, 27, 17, 41, 117, 77, 206, 540, 1315]

cp's OEIS Frontend

A346268 a(n) is the smallest positive number not yet in a(0..n-1) such that the absolute differences of order k = 1 .. n-1 of a(0..n) contain a maximum of k-1 duplicate values. We define a(0) = 1.

Table of values

List of values