Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A042982
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A042982 Number of degree-n irreducible polynomials over GF(2) with trace = 1 and subtrace = 1. +0
7
0, 1, 0, 1, 2, 2, 5, 8, 13, 27, 45, 85, 160, 288, 550, 1024, 1920, 3654, 6885, 13107, 24989, 47616, 91225, 174760, 335462, 645435, 1242600, 2396745, 4628480, 8947294, 17318945, 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 = 3 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.

Adjacent sequences: A042979 A042980 A042981 this_sequence A042983 A042984 A042985

Sequence in context: A126291 A056224 A052527 this_sequence A006367 A077902 A005834

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 October 10 20:39 EDT 2008. Contains 144831 sequences.


AT&T Labs Research