Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A042979
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A042979 Number of degree-n irreducible polynomials over GF(2) with trace = 0 and subtrace = 1. +0
10
0, 0, 1, 0, 2, 2, 4, 8, 13, 24, 48, 80, 160, 288, 541, 1024, 1920, 3626, 6912, 13056, 24989, 47616, 91136, 174760, 335462, 645120, 1242904, 2396160, 4628480, 8947294, 17317888, 33554432 (list; graph; listen)
OFFSET

1,5

REFERENCES

K. Cattell, C.R. Miers, F. Ruskey, J. Sawada and M. Serra, "The Number of Irreducible Polynomials over GF(2) with Given Trace and Subtrace", J. Comb. Math. and Comb. Comp., 47 (2003) 31-64.

LINKS

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

FORMULA

a(n) = Sum{ L(n, k) : n+k = 1 mod 4}, where L(n, k) = Sum{ mu(d)*{n/d choose k/d} : d|GCD(n, k)}

CROSSREFS

Cf. A042979-A042982.

Cf. A074027-A074030.

Sequence in context: A039941 A104700 A036761 this_sequence A000018 A075126 A098788

Adjacent sequences: A042976 A042977 A042978 this_sequence A042980 A042981 A042982

KEYWORD

nonn

AUTHOR

Frank Ruskey (fruskey(AT)cs.uvic.ca)

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research