|
| |
|
|
A108346
|
|
Least positive number a(n) such that P2(2n+1,q) divides Q(a(n),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.
|
|
0
| |
|
|
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
(list; graph; refs; listen; history; internal format)
|
| |
| |
|
|
