A108346 - cp's OEIS frontend

A108346 a(n) is the least positive number k such that P2(2n+1,q) divides Q(k,q), where both P2 and Q are polynomials in GF(2) and P2(n,q) is the n-th binary polynomial, i.e., P2(n,q) = Sum_{i>=0} b(i)q^i, with n = Sum_{i>=0} b(i)2^i; and Q(m,q) is 1 + q^m.

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

[1, 1, 2, 3, 3, 7, 7, 4, 4, 15, 6, 7, 15, 6, 7, 5, 5, 21, 31, 14, 31, 15, 12, 31, 21, 8, 15, 31, 14, 31, 31, 6, 6, 63, 14, 31, 9, 28, 31, 15, 14, 21, 8, 21, 31, 63, 15, 30, 63, 10, 21, 63, 28, 12, 63, 31, 31, 63, 21, 12, 15, 31, 30, 7, 7, 127, 93, 60, 127, 15, 62, 127, 127, 62]

cp's OEIS Frontend

A108346 a(n) is the least positive number k such that P2(2n+1,q) divides Q(k,q), where both P2 and Q are polynomials in GF(2) and P2(n,q) is the n-th binary polynomial, i.e., P2(n,q) = Sum_{i>=0} b(i)q^i, with n = Sum_{i>=0} b(i)2^i; and Q(m,q) is 1 + q^m.

Table of values

List of values

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

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

cp's OEIS Frontend

A108346 a(n) is the least positive number k such that P2(2n+1,q) divides Q(k,q), where both P2 and Q are polynomials in GF(2) and P2(n,q) is the n-th binary polynomial, i.e., P2(n,q) = Sum_{i>=0} b(i)*q^i, with n = Sum_{i>=0} b(i)*2^i; and Q(m,q) is 1 + q^m.

Table of values

List of values

A108346 a(n) is the least positive number k such that P2(2n+1,q) divides Q(k,q), where both P2 and Q are polynomials in GF(2) and P2(n,q) is the n-th binary polynomial, i.e., P2(n,q) = Sum_{i>=0} b(i)q^i, with n = Sum_{i>=0} b(i)2^i; and Q(m,q) is 1 + q^m.

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