A327190 - cp's OEIS frontend

A327190 For any n > 0: consider the different ways to split the binary representation of 2n+1 into two nonempty parts, say with value x and y; a(n) is the least possible value of x y.

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

[1, 1, 3, 1, 3, 3, 7, 1, 3, 5, 7, 3, 9, 7, 15, 1, 3, 5, 7, 5, 11, 11, 15, 3, 9, 13, 21, 7, 21, 15, 31, 1, 3, 5, 7, 9, 11, 13, 15, 5, 15, 21, 23, 11, 27, 23, 31, 3, 9, 15, 21, 13, 33, 27, 45, 7, 21, 29, 49, 15, 45, 31, 63, 1, 3, 5, 7, 9, 11, 13, 15, 9, 19, 21]

cp's OEIS Frontend

A327190 For any n > 0: consider the different ways to split the binary representation of 2n+1 into two nonempty parts, say with value x and y; a(n) is the least possible value of x y.

Table of values

List of values

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

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

cp's OEIS Frontend

A327190 For any n > 0: consider the different ways to split the binary representation of 2*n+1 into two nonempty parts, say with value x and y; a(n) is the least possible value of x * y.

Table of values

List of values

A327190 For any n > 0: consider the different ways to split the binary representation of 2n+1 into two nonempty parts, say with value x and y; a(n) is the least possible value of x y.

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