Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A115505
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A115505 Number of monic irreducible polynomials of degree 2 in GF(2^n)[x1,x2,x3,x4,x5]. +0
49
2095135, 1466014571406, 1317624575992306876, 1289520874254978952587000, 1308542555074300717818898758640, 1350326852860866917910548456417128416, 1404771351088543190017398373020865731215296 (list; graph; listen)
OFFSET

1,1

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-A115504.

Sequence in context: A113568 A155125 A155126 this_sequence A126435 A011571 A022537

Adjacent sequences: A115502 A115503 A115504 this_sequence A115506 A115507 A115508

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 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research