|
|
A353167
|
|
Polynomials over GF(2) that are divisible by (x+1)^2 = x^2+1, encoded as binary numbers.
|
|
2
|
|
|
0, 5, 10, 15, 17, 20, 27, 30, 34, 39, 40, 45, 51, 54, 57, 60, 65, 68, 75, 78, 80, 85, 90, 95, 99, 102, 105, 108, 114, 119, 120, 125, 130, 135, 136, 141, 147, 150, 153, 156, 160, 165, 170, 175, 177, 180, 187, 190, 195, 198, 201, 204, 210, 215, 216, 221, 225, 228, 235
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
See also A001969 for those divisible by x+1 (and obviously the present sequence is a subsequence of that one).
Integers with an even number of 1-bits at even positions, and an even number of 1-bits at odd positions, and so all k with A355487(k) = 0.
Among four integers 4*i ..4*i+3, exactly one is a term here so that a(n) can be calculated by appending two bits to n-1 to ensure the two 1-bit counts are even, so a(n) = 4*(n-1) + A355487(n-1).
(End)
|
|
LINKS
|
|
|
PROG
|
(PARI) a(n) = n--; n<<2 + if(n, fold(bitxor, digits(n, 4))); \\ Kevin Ryde, Jul 01 2022
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|