Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A115490
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A115490 Number of monic irreducible polynomials of degree 4 in GF(2^n)[x]. +0
1
3, 60, 1008, 16320, 261888, 4193280, 67104768, 1073725440, 17179803648, 274877644800, 4398045462528, 70368739983360, 1125899890065408, 18014398442373120, 288230375883276288, 4611686017353646080 (list; graph; listen)
OFFSET

1,1

FORMULA

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

a(n)=4*16^n-4^n, with n>=0 - Paolo P. Lava (ppl(AT)spl.at), Jun 16 2008

CROSSREFS

Adjacent sequences: A115487 A115488 A115489 this_sequence A115491 A115492 A115493

Sequence in context: A081853 A002738 A006432 this_sequence A065889 A001084 A137150

KEYWORD

nonn

AUTHOR

Max Alekseyev (maxal(AT)cs.ucsd.edu)

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 October 13 20:18 EDT 2008. Contains 145016 sequences.


AT&T Labs Research