login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A136384 Quotient obtained when A136380(n)/2 is considered as a GF(2)[X]-polynomial and it is divided by (x + 1). 6

%I #4 Mar 31 2012 14:02:29

%S 4,48,3360,14043520,233515838757120,65982595605873500894008888320,

%T 5233741023536997251047595348728205456443682897303843358720,

%U 32837130684987081672210288030183520098814938795984162933658101468543499651419210151303128996446334767341864627691520

%N Quotient obtained when A136380(n)/2 is considered as a GF(2)[X]-polynomial and it is divided by (x + 1).

%C Note that each term a(n) fits into A007283(n-1) bits.

%H A. Karttunen, <a href="/A136384/b136384.txt">Table of n, a(n) for n = 1..11</a>

%H A. Karttunen, <a href="/A036284/a036284.c.txt">C program for computing this sequence</a>

%Y A136385 shows the same sequence in octal base. Cf. A036284, A136380, A136382.

%K nonn,base

%O 1,1

%A _Antti Karttunen_, Dec 29 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 20 00:03 EDT 2024. Contains 371798 sequences. (Running on oeis4.)