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

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A115462 Number of monic irreducible polynomials of degree n in GF(3)[x,y,z]. 0
1, 39, 28704, 1742232560, 25015702424562603, 261673815513000717140575872, 5986257591270542940940766674496702426288, 898505149957215365756286256207383540787286531952289973040 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

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

Max Alekseyev, Formula for the number of monic irreducible polynomials in a finite field

Max Alekseyev, PARI scripts for various problems

J. von zur Gathen, K. Ziegler, Survey on counting special types of polynomials, arXiv preprint arXiv:1407.2970, 2014

Konstantin Ziegler, Counting Classes of Special Polynomials, Doctoral Dissertation, University of Bonn, June 2014.

CROSSREFS

Cf. A115457-A115505.

Sequence in context: A266307 A210327 A174765 * A268072 A268422 A112950

Adjacent sequences:  A115459 A115460 A115461 * A115463 A115464 A115465

KEYWORD

nonn

AUTHOR

Max Alekseyev, Jan 16 2006

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 11 08:42 EST 2016. Contains 279044 sequences.