A160856 - cp's OEIS frontend

A160856 a(1)=1. a(n) = the smallest integer > a(n-1) such that a(n) written in binary contains binary n as a substring, and such that (for n>=2) each value a(k)-a(k-1), for 2<=k<=n, is unique.

n	a(n)
1	1
2	4
3	6
4	12
5	20
6	24
7	29
8	40
9	50
10	74
11	86
12	99
13	106
14	115
15	143
16	160
17	196
18	210
19	230
20	276
21	298
22	342
23	367
24	385
25	400
26	416
27	435
28	456
29	479
30	505
31	543
32	576
33	644
34	674
35	711
36	740
37	805
38	844
39	871
40	928
41	978
42	1066
43	1111
44	1196
45	1243
46	1326
47	1374
48	1408
49	1457
50	1508
51	1587
52	1640

[1, 4, 6, 12, 20, 24, 29, 40, 50, 74, 86, 99, 106, 115, 143, 160, 196, 210, 230, 276, 298, 342, 367, 385, 400, 416, 435, 456, 479, 505, 543, 576, 644, 674, 711, 740, 805, 844, 871, 928, 978, 1066, 1111, 1196, 1243, 1326, 1374, 1408, 1457, 1508, 1587, 1640]

cp's OEIS Frontend

A160856 a(1)=1. a(n) = the smallest integer > a(n-1) such that a(n) written in binary contains binary n as a substring, and such that (for n>=2) each value a(k)-a(k-1), for 2<=k<=n, is unique.

Table of values

List of values