OFFSET
1,1
COMMENTS
LINKS
EXAMPLE
5 is included in this sequence, because, although it is prime, its binary representation '101' encodes a polynomial x^2 + 1, which is reducible in polynomial ring GF(2)[X] as (x+1)(x+1), i.e., 5 = A048720(3,3).
9 is included in this sequence, as it factors as 3*3 in Z, the corresponding polynomial (bin.repr. '1001'): x^3 + 1 factors as (x+1)(x^2+x+1), i.e., 9 = A048720(3,7), so even although the number of prime/irreducible factors is the same, the factors themselves (i.e., their binary codes) are not exactly the same, thus 9 is included here.
On the other hand, none of 2, 3, 4, 11 and 111 are included in this sequence because they occur in the complement sequence, A235032 (please see examples there).
PROG
(Scheme, with Antti Karttunen's IntSeq-library)
(define A235033 (MATCHING-POS 1 0 (lambda (n) (not (or (zero? n) (equal? (ifactor n) (GF2Xfactor n)))))))
CROSSREFS
Characteristic function: A235046.
KEYWORD
nonn
AUTHOR
Antti Karttunen, Jan 02 2014
STATUS
approved