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

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

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

REFERENCES

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

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

CROSSREFS

Cf. A115457-A115505.

Sequence in context: A027490 A210327 A174765 * A112950 A173364 A023931

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

Content is available under The OEIS End-User License Agreement .

Last modified November 27 21:59 EST 2014. Contains 250286 sequences.