Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A115500
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A115500 Number of monic irreducible polynomials of degree 1 in GF(2^n)[x1,x2,x3,x4]. +0
1
30, 340, 4680, 69904, 1082400, 17043520, 270549120, 4311810304, 68853957120, 1100586419200, 17600780175360, 281543712968704, 4504149450301440, 72061992352890880, 1152956690052710400, 18447025552981295104 (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-A115505.

Sequence in context: A159543 A006859 A107967 this_sequence A125418 A107916 A091775

Adjacent sequences: A115497 A115498 A115499 this_sequence A115501 A115502 A115503

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 | The OEIS Foundation | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified March 20 01:21 EDT 2010. Contains 173643 sequences.


AT&T Labs Research