login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A038518 Number of elements of GF(2^n) with trace 0 and subtrace 0. 3
0, 1, 1, 1, 6, 6, 16, 36, 56, 136, 256, 496, 1056, 2016, 4096, 8256, 16256, 32896, 65536, 130816, 262656, 523776, 1048576, 2098176, 4192256, 8390656, 16777216, 33550336, 67117056, 134209536, 268435456, 536887296, 1073709056, 2147516416 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,5

LINKS

Table of n, a(n) for n=0..33.

F. Ruskey, Number of irreducible polynomials over GF(2) with given trace and subtrace

F. Ruskey, Number of elements of GF(2^n) of given trace and subtrace

FORMULA

C(n, r+0)+C(n, r+4)+C(n, r+8)+... where r = 0 if n odd, r = 2 if n even.

G.f.: (-x^3+x^2+x)/[(1-2x)(1+2x+2x^2)].

a(0)=0; a(n)= ( 2^n - (-1-i)^n - (-1+i)^n )/4, i=sqrt(-1) - C. Ronaldo (aga_new_ac(AT)hotmail.com), Dec 16 2004

MAPLE

0, seq(1/4*2^k-1/4*(-1-I)^k-1/4*(-1+I)^k, k=1..40); seq(coeff(convert(series((-x^3+x^2+x)/((1-2*x)*(1+2*x+2*x^2)), x, 50), polynom), x, i), i=0..40); (C. Ronaldo)

CROSSREFS

Cf. A038503, A038505.

Cf. A038519, A038520, A038521.

Sequence in context: A315813 A168460 A315814 * A151724 A315815 A298026

Adjacent sequences:  A038515 A038516 A038517 * A038519 A038520 A038521

KEYWORD

easy,nonn

AUTHOR

Frank Ruskey

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 16:26 EDT 2019. Contains 322430 sequences. (Running on oeis4.)