Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A115457
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A115457 Number of monic irreducible polynomials of degree n in GF(2)[x,y]. +0
51
1, 6, 35, 694, 26089, 1862994, 253247715, 66799608630, 34698378752226, 35781375988234520, 73534241823793715433, 301714422751259316744750, 2473763407036784492590791565, 40547483778956508623734286010210 (list; graph; listen)
OFFSET

0,2

REFERENCES

Arnaud Bodin, Number of irreducible polynomials in several variables over finite fields, http://arxiv.org/abs/0706.0157, Amer. Math. Monthly, 115 (2008), 653-660.

LINKS

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

Max Alekseyev, PARI scripts for various problems

CROSSREFS

Cf. A122743.

Cf. A115458-A115505.

Sequence in context: A093989 A051337 A152128 this_sequence A128298 A059059 A050112

Adjacent sequences: A115454 A115455 A115456 this_sequence A115458 A115459 A115460

KEYWORD

nonn

AUTHOR

Max Alekseyev (maxale(AT)gmail.com), Jan 16 2006

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 December 11 12:57 EST 2009. Contains 170656 sequences.


AT&T Labs Research