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

%I #15 Mar 13 2014 14:27:43

%S 5,10,15,17,20,23,25,29,30,34,35,40,43,45,46,50,51,53,55,58,60,65,68,

%T 69,70,71,75,79,80,83,85,86,87,89,90,92,95,100,101,102,105,106,107,

%U 110,113,115,116,119,120,125,127,129,130,135,136,138,139,140,142,145,149,150

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

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

%H Antti Karttunen, <a href="/A236848/b236848.txt">Table of n, a(n) for n = 1..12311</a>

%o (Scheme, with _Antti Karttunen_'s IntSeq-library, two different implementations)

%o (define A236848 (MATCHING-POS 1 1 (lambda (n) (any (lambda (p) (= 1 (A091247 p))) (ifactor n)))))

%o (define A236848 (COMPLEMENT 1 A236860))

%Y Disjoint union of A236844 and A236849.

%Y Complement: A236860.

%Y Cf. A091209, A236838.

%K nonn

%O 1,1

%A _Antti Karttunen_, Jan 31 2014