A303763 - cp's OEIS frontend

A303763 Permutation of nonnegative integers: a(0) = 0 and for n > 0, a(n) = the least k for which bitor(k,a(n-1)) = a(n-1) and k is not already present, and otherwise, if no such k exists, the least number not already present that can be obtained by cumulatively filling the successive vacant bits of a(n-1) from its least significant end (by toggling 0's to 1's, possibly also one or more leading zeros).

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

[0, 1, 3, 2, 7, 4, 5, 15, 6, 31, 8, 9, 11, 10, 63, 12, 13, 127, 14, 255, 16, 17, 19, 18, 23, 20, 21, 511, 22, 1023, 24, 25, 27, 26, 2047, 28, 29, 4095, 30, 8191, 32, 33, 35, 34, 39, 36, 37, 47, 38, 16383, 40, 41, 43, 42, 32767, 44, 45, 65535, 46, 131071, 48, 49, 51, 50, 55, 52, 53, 262143, 54, 524287, 56, 57, 59, 58, 1048575, 60, 61]

cp's OEIS Frontend

Table of values

List of values