Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A007839
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A007839 Number of polynomials of degree n over GF(2) in which the degrees of all irreducible factors are distinct. +0
1
1, 2, 1, 4, 7, 14, 28, 54, 111, 218, 436, 854, 1735, 3432, 6825, 13664, 27352, 54218, 108714, 216616, 432239, 864548, 1727408, 3441364, 6891458, 13756440, 27466896, 54922134, 109751871, 219035562, 438319568, 875529382 (list; graph; listen)
OFFSET

0,2

LINKS

A. Knopfmacher and R. Warlimont, Distinct degree factorizations for polynomials over a finite field, Trans. Amer. Math. Soc. 347 (1995), no. 6, 2235-2243.

FORMULA

G.f.: prod {m ge 1} (1 + pi(m) x^m), where pi(m) = A001037(m) = number of distinct irreducible polynomials of degree m.

EXAMPLE

a(3)=4 from x^3+x+1, x^3+x^2+1, x(x^2+x+1), (x+1)(x^2+x+1).

CROSSREFS

Sequence in context: A123360 A072015 A123242 this_sequence A045625 A001933 A038557

Adjacent sequences: A007836 A007837 A007838 this_sequence A007840 A007841 A007842

KEYWORD

nonn,easy,nice

AUTHOR

Arnold Knopfmacher [ ARNOLDK(AT)gauss.cam.wits.ac.za ]

EXTENSIONS

More terms from David W. Wilson (davidwwilson(AT)comcast.net).

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 July 4 01:34 EDT 2008. Contains 140787 sequences.


AT&T Labs Research