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 A236380 #12 Aug 11 2015 01:23:51 %S A236380 0,0,0,0,0,4,0,0,0,16,8,0,0,0,0,12,0,64,32,0,16,40,0,16,0,8,0,48,0,4, %T A236380 24,0,0,64,128,64,64,0,0,76,32,0,80,32,0,172,32,0,0,56,16,192,0,4,96, %U A236380 16,0,64,8,0,48,0,0,120,0,384,128,0,256,64,128,112,128,0,0,300,0,128,152,96,64,152,0,148,160,644,64 %N A236380 Difference between value of n, when remultiplied "upward", from GF(2)[X] to N, and when remultiplied "downward", from N to GF(2)[X]: a(n) = A234742(n) - A234741(n). %C A236380 All terms are divisible by 4. %C A236380 a(n) = 0 iff both A236378(n) and A236379(n) are zero, or in other words, iff A234741(n)=n and A234742(n)=n, which means that A235032 gives all such n, that a(n) = 0. %H A236380 Antti Karttunen, <a href="/A236380/b236380.txt">Table of n, a(n) for n = 0..8191</a> %F A236380 a(n) = A234742(n) - A234741(n). %F A236380 a(n) = A236378(n) + A236379(n). %o A236380 (Scheme, two variants) %o A236380 (define (A236380 n) (- (A234742 n) (A234741 n))) %o A236380 (define (A236380v2 n) (+ (A236378 n) (A236379 n))) %Y A236380 A235032 gives the positions of zeros, A235033 the positions of nonzeros. %Y A236380 Cf. also A234741, A234742, A236378, A236379, A236851, A061858. %K A236380 nonn %O A236380 0,6 %A A236380 _Antti Karttunen_, Jan 24 2014