Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A115491
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A115491 Number of monic irreducible polynomials of degree 5 in GF(2^n)[x]. +0
1
6, 204, 6552, 209712, 6710880, 214748352, 6871947648, 219902325504, 7036874417664, 225179981368320, 7205759403792384, 230584300921368576, 7378697629483819008, 236118324143482257408, 7555786372591432335360 (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

FORMULA

a(0)=0, a(1)=6, a(n)=34a(n-1)-64a(n-2) - T. D. Noe (noe(AT)sspectra.com), Nov 30 2006

a(n)=-(2/5)*2^n+(32/5)*32^n, with n>=0 - Paolo P. Lava (ppl(AT)spl.at), Jun 17 2008

CROSSREFS

Cf. A115457-A115505.

Sequence in context: A112845 A109058 A003743 this_sequence A082405 A054653 A061540

Adjacent sequences: A115488 A115489 A115490 this_sequence A115492 A115493 A115494

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 21 10:15 EST 2009. Contains 171081 sequences.


AT&T Labs Research