A236848 Numbers that have at least one prime divisor encoding a reducible polynomial in ring GF(2)[X]; multiples of terms of A091209.

5, 10, 15, 17, 20, 23, 25, 29, 30, 34, 35, 40, 43, 45, 46, 50, 51, 53, 55, 58, 60, 65, 68, 69, 70, 71, 75, 79, 80, 83, 85, 86, 87, 89, 90, 92, 95, 100, 101, 102, 105, 106, 107, 110, 113, 115, 116, 119, 120, 125, 127, 129, 130, 135, 136, 138, 139, 140, 142, 145, 149, 150

Offset

1,1

Comments

Numbers that are divisible by at least one prime whose binary representation encodes a polynomial which is reducible in polynomial ring GF(2)[X].

Links

Antti Karttunen, Table of n, a(n) for n = 1..12311

Prog

(Scheme, with Antti Karttunen's IntSeq-library, two different implementations)
(define A236848 (MATCHING-POS 1 1 (lambda (n) (any (lambda (p) (= 1 (A091247 p))) (ifactor n)))))
(define A236848 (COMPLEMENT 1 A236860))

Crossrefs

Disjoint union of A236844 and A236849.

Complement: A236860.

Cf. A091209, A236838.

Sequence in context: A044845 A313667 A313668 * A236835 A236844 A271468

Adjacent sequences: A236845 A236846 A236847 * A236849 A236850 A236851

Keyword

nonn

Author

Antti Karttunen, Jan 31 2014

Status

approved