a hard sequence worthy of attention

[Jon Awbrey]

o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o

just to check, do you mean the 2^n boolean functions
that are linear over B = GF(2), i.e., viewing B^n as
a finite dimensional vector space, their number is
equal to |B^n|?

ja

N. J. A. Sloane wrote:
> 
> There was some discussion on this list
> a while back about sequences that would
> make good projects.
> 
> Here is an old one where nothing has been done for many years:
> 
> %I A001289
> %S A001289 1,2,3,8,48,150357
<...>
> It is important in the study of Reed-Muller codes.
> 
> NJAS

o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o
inquiry e-lab: http://stderr.org/pipermail/inquiry/
o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o