This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A236848 #15 Mar 13 2014 14:27:43 %S A236848 5,10,15,17,20,23,25,29,30,34,35,40,43,45,46,50,51,53,55,58,60,65,68, %T A236848 69,70,71,75,79,80,83,85,86,87,89,90,92,95,100,101,102,105,106,107, %U A236848 110,113,115,116,119,120,125,127,129,130,135,136,138,139,140,142,145,149,150 %N A236848 Numbers that have at least one prime divisor encoding a reducible polynomial in ring GF(2)[X]; multiples of terms of A091209. %C A236848 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 A236848 Antti Karttunen, <a href="/A236848/b236848.txt">Table of n, a(n) for n = 1..12311</a> %o A236848 (Scheme, with _Antti Karttunen_'s IntSeq-library, two different implementations) %o A236848 (define A236848 (MATCHING-POS 1 1 (lambda (n) (any (lambda (p) (= 1 (A091247 p))) (ifactor n))))) %o A236848 (define A236848 (COMPLEMENT 1 A236860)) %Y A236848 Disjoint union of A236844 and A236849. %Y A236848 Complement: A236860. %Y A236848 Cf. A091209, A236838. %K A236848 nonn %O A236848 1,1 %A A236848 _Antti Karttunen_, Jan 31 2014