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 A136384 #4 Mar 31 2012 14:02:29 %S A136384 4,48,3360,14043520,233515838757120,65982595605873500894008888320, %T A136384 5233741023536997251047595348728205456443682897303843358720, %U A136384 32837130684987081672210288030183520098814938795984162933658101468543499651419210151303128996446334767341864627691520 %N A136384 Quotient obtained when A136380(n)/2 is considered as a GF(2)[X]-polynomial and it is divided by (x + 1). %C A136384 Note that each term a(n) fits into A007283(n-1) bits. %H A136384 A. Karttunen, <a href="/A136384/b136384.txt">Table of n, a(n) for n = 1..11</a> %H A136384 A. Karttunen, <a href="/A036284/a036284.c.txt">C program for computing this sequence</a> %Y A136384 A136385 shows the same sequence in octal base. Cf. A036284, A136380, A136382. %K A136384 nonn,base %O A136384 1,1 %A A136384 _Antti Karttunen_, Dec 29 2007