A357482 - cp's OEIS frontend

A357482 a(0) = 0; for n > 0, a(n) is the smallest positive number not occurring earlier such that the binary string of the number of 1's in the binary value of a(n) + the number of 1's in the binary values of all previous terms does not appear in the binary string concatenation of a(0)..a(n-1).

n	a(n)
0	0
1	1
2	2
3	3
4	7
5	4
6	5
7	63
8	8
9	6
10	9
11	16
12	127
13	11
14	10
15	12
16	13
17	14
18	19
19	511
20	1023
21	15
22	21
23	17
24	31
25	18
26	20
27	22
28	24
29	25
30	33
31	23
32	27
33	26
34	28
35	35
36	37
37	38
38	41
39	1535
40	29
41	30
42	32
43	34
44	47
45	36
46	40
47	55
48	39
49	43
50	42
51	45
52	255
53	46
54	51
55	383
56	48
57	44
58	4095
59	64
60	447
61	65
62	95
63	53
64	191
65	767
66	1791
67	59
68	49
69	54
70	57
71	50
72	52

[0, 1, 2, 3, 7, 4, 5, 63, 8, 6, 9, 16, 127, 11, 10, 12, 13, 14, 19, 511, 1023, 15, 21, 17, 31, 18, 20, 22, 24, 25, 33, 23, 27, 26, 28, 35, 37, 38, 41, 1535, 29, 30, 32, 34, 47, 36, 40, 55, 39, 43, 42, 45, 255, 46, 51, 383, 48, 44, 4095, 64, 447, 65, 95, 53, 191, 767, 1791, 59, 49, 54, 57, 50, 52]

cp's OEIS Frontend

A357482 a(0) = 0; for n > 0, a(n) is the smallest positive number not occurring earlier such that the binary string of the number of 1's in the binary value of a(n) + the number of 1's in the binary values of all previous terms does not appear in the binary string concatenation of a(0)..a(n-1).

Table of values

List of values