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 A236845 #8 Mar 13 2014 14:27:16 %S A236845 91,117,143,171,182,234,247,273,286,333,342,351,361,364,369,429,451, %T A236845 468,471,494,501,513,539,546,572,609,637,666,675,684,687,702,721,722, %U A236845 728,738,741,803,819,847,858,902,936,942,949,957,981,988,999,1001,1002,1026,1053,1078,1083,1092,1107,1125 %N A236845 Numbers that occur in more than one way as results of "upward" remultiplication (GF(2)[X] -> N) of some number. %C A236845 Numbers that occur more than once in A234742. %C A236845 Those terms that encode an irreducible polynomial in ring GF(2)[X] with their binary representation (that is, those that are in A014580) seem to occur also all in A091214 (that is, are a subsequence of the latter). %C A236845 If n is a term, then 2n is also a term. %H A236845 Antti Karttunen, <a href="/A236845/b236845.txt">Table of n, a(n) for n = 1..5636</a> %o A236845 (Scheme, with _Antti Karttunen_'s IntSeq-library) %o A236845 (define A236845 (MATCHING-POS 1 0 (lambda (n) (> (A236853 n) 1)))) %Y A236845 Positions of terms larger than one in A236853. %Y A236845 Cf. A236844, A091214, A014580. %Y A236845 Cf. also A236835. %K A236845 nonn %O A236845 1,1 %A A236845 _Antti Karttunen_, Jan 31 2014