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 A236849 #13 Mar 13 2014 14:28:04 %S A236849 25,50,55,75,87,100,110,115,145,150,165,174,175,185,200,203,213,220, %T A236849 225,230,253,261,275,285,290,299,300,301,319,325,330,345,348,350,355, %U A236849 357,370,375,385,391,395,400,406,415,425,426,435,440,445,450,460,475,477,495,505,506,515,522,525,529,535,545,550,555 %N A236849 Numbers that occur as results of remultiplication (GF(2)[X] -> N) of some number and have at least one prime divisor encoding a reducible polynomial in ring GF(2)[X]. %C A236849 Terms of A236842 (A234742) that are divisible by at least one of the primes in A091209. %C A236849 a(4)=75, is the first term here which does not occur in A236834. On the other hand, A236834(5)=91 is the first of its terms that does not occur here. %H A236849 Antti Karttunen, <a href="/A236849/b236849.txt">Table of n, a(n) for n = 1..13105</a> %o A236849 (Scheme, with _Antti Karttunen_'s IntSeq-library) %o A236849 (define A236849 (COMPOSE A236842 (MATCHING-POS 1 1 (lambda (n) (any (lambda (p) (= 1 (A091247 p))) (ifactor (A236842 n))))))) %Y A236849 Setwise difference A236848 \ A236844, and also A236842 \ A236860. %Y A236849 Cf. A091209, A234742, A236842, A236848, A236834. %K A236849 nonn %O A236849 1,1 %A A236849 _Antti Karttunen_, Jan 31 2014