A359627 Irregular table read by rows; the n-th row lists the divisors d of 2*n such that the binary expansions of d and 2*n have no common 1-bit.
1, 1, 2, 1, 1, 2, 4, 1, 5, 1, 2, 3, 1, 1, 2, 4, 8, 1, 9, 1, 2, 10, 1, 1, 2, 3, 4, 6, 1, 1, 2, 1, 1, 2, 4, 8, 16, 1, 17, 1, 2, 3, 9, 18, 1, 1, 2, 4, 5, 20, 1, 21, 1, 2, 1, 1, 2, 3, 4, 6, 8, 12, 1, 5, 1, 2, 1, 9, 1, 2, 4, 7, 1, 1, 2, 3, 1, 1, 2, 4, 8, 16, 32
Offset: 1
Examples
Table T(n, k) begins:
[1]
[1, 2]
[1]
[1, 2, 4]
[1, 5]
[1, 2, 3]
[1]
[1, 2, 4, 8]
[1, 9]
[1, 2, 10]
[1]
[1, 2, 3, 4, 6]
[1]
[1, 2]
[1]
[1, 2, 4, 8, 16]
[1, 17]
Programs
-
PARI
row(n) = { select(d -> bitand(d, 2*n)==0, divisors(2*n)) }
Comments