A266195 - cp's OEIS frontend

A266195 Match-making permutation: start with a(1) = 1, then always choose for a(n) the least unused number such that multiplying a(n) by a(n-1) does not produce any carries when performed in base 2.

n	a(n)
1	1
2	2
3	3
4	4
5	5
6	6
7	8
8	7
9	9
10	10
11	12
12	16
13	11
14	17
15	13
16	32
17	14
18	18
19	20
20	19
21	33
22	15
23	34
24	22
25	64
26	21
27	24
28	36
29	28
30	65
31	23
32	66
33	25
34	40
35	35
36	72
37	42
38	48
39	37
40	68
41	26
42	128
43	27
44	129
45	29
46	130
47	30
48	132
49	31
50	256
51	38
52	80
53	49
54	73
55	56
56	136
57	41
58	96
59	69
60	144
61	67
62	84
63	97
64	137
65	112
66	145
67	134
68	160
69	50
70	133
71	76
72	161
73	100
74	257
75	39
76	258
77	43
78	260
79	44

[1, 2, 3, 4, 5, 6, 8, 7, 9, 10, 12, 16, 11, 17, 13, 32, 14, 18, 20, 19, 33, 15, 34, 22, 64, 21, 24, 36, 28, 65, 23, 66, 25, 40, 35, 72, 42, 48, 37, 68, 26, 128, 27, 129, 29, 130, 30, 132, 31, 256, 38, 80, 49, 73, 56, 136, 41, 96, 69, 144, 67, 84, 97, 137, 112, 145, 134, 160, 50, 133, 76, 161, 100, 257, 39, 258, 43, 260, 44]

cp's OEIS Frontend

A266195 Match-making permutation: start with a(1) = 1, then always choose for a(n) the least unused number such that multiplying a(n) by a(n-1) does not produce any carries when performed in base 2.

Table of values

List of values

n	a(n)
1	1
2	2
3	3
4	4
5	5
6	6
7	8
8	7
9	9
10	10
11	12
12	16
13	11
14	17
15	13
16	32
17	14
18	18
19	20
20	19
21	33
22	15
23	34
24	22
25	64
26	21
27	24
28	36
29	28
30	65
31	23
32	66
33	25
34	40
35	35
36	72
37	42
38	48
39	37
40	68
41	26
42	128
43	27
44	129
45	29
46	130
47	30
48	132
49	31
50	256
51	38
52	80
53	49
54	73
55	56
56	136
57	41
58	96
59	69
60	144
61	67
62	84
63	97
64	137
65	112
66	145
67	134
68	160
69	50
70	133
71	76
72	161
73	100
74	257
75	39
76	258
77	43
78	260
79	44

n	a(n)
1	1
2	2
3	3
4	4
5	5
6	6
7	8
8	7
9	9
10	10
11	12
12	16
13	11
14	17
15	13
16	32
17	14
18	18
19	20
20	19
21	33
22	15
23	34
24	22
25	64
26	21
27	24
28	36
29	28
30	65
31	23
32	66
33	25
34	40
35	35
36	72
37	42
38	48
39	37
40	68
41	26
42	128
43	27
44	129
45	29
46	130
47	30
48	132
49	31
50	256
51	38
52	80
53	49
54	73
55	56
56	136
57	41
58	96
59	69
60	144
61	67
62	84
63	97
64	137
65	112
66	145
67	134
68	160
69	50
70	133
71	76
72	161
73	100
74	257
75	39
76	258
77	43
78	260
79	44

n	a(n)
1	1
2	2
3	3
4	4
5	5
6	6
7	8
8	7
9	9
10	10
11	12
12	16
13	11
14	17
15	13
16	32
17	14
18	18
19	20
20	19
21	33
22	15
23	34
24	22
25	64
26	21
27	24
28	36
29	28
30	65
31	23
32	66
33	25
34	40
35	35
36	72
37	42
38	48
39	37
40	68
41	26
42	128
43	27
44	129
45	29
46	130
47	30
48	132
49	31
50	256
51	38
52	80
53	49
54	73
55	56
56	136
57	41
58	96
59	69
60	144
61	67
62	84
63	97
64	137
65	112
66	145
67	134
68	160
69	50
70	133
71	76
72	161
73	100
74	257
75	39
76	258
77	43
78	260
79	44