Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A115460
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A115460 Number of monic irreducible polynomials of degree n in GF(2)[x1,x2,x3,x4,x5]. +0
1
1, 62, 2095135, 72057593905890750, 85070591730234615861304021242850041053, 7237005577332262213973186563042994235469926762597754302088290406498628562618 (list; graph; listen)
OFFSET

0,2

LINKS

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: A123806 A093262 A159374 this_sequence A116270 A102241 A084507

Adjacent sequences: A115457 A115458 A115459 this_sequence A115461 A115462 A115463

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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research