Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A091221
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A091221 Number of distinct irreducible polynomials dividing n-th GF(2)[X]-polynomial. +0
7
0, 1, 1, 1, 1, 2, 1, 1, 2, 2, 1, 2, 1, 2, 1, 1, 1, 3, 1, 2, 1, 2, 2, 2, 1, 2, 2, 2, 2, 2, 1, 1, 2, 2, 2, 3, 1, 2, 2, 2, 1, 2, 2, 2, 2, 3, 1, 2, 2, 2, 1, 2, 2, 3, 1, 2, 2, 3, 1, 2, 1, 2, 2, 1, 2, 3, 1, 2, 1, 3, 2, 3, 1, 2, 2, 2, 2, 3, 2, 2, 1, 2, 3, 2, 1, 3, 1, 2, 2, 3, 1, 3, 2, 2, 2, 2, 1, 3, 2, 2, 3, 2 (list; graph; listen)
OFFSET

1,6

LINKS

A. Karttunen, Scheme-program for computing this sequence.

Index entries for sequences operating on GF(2)[X]-polynomials

CROSSREFS

a(n) = A001221(A091203(n)) = A001221(A091205(n)). A000374(n) = a(A000051(n)).

Sequence in context: A122497 A154402 A023396 this_sequence A106495 A100428 A093914

Adjacent sequences: A091218 A091219 A091220 this_sequence A091222 A091223 A091224

KEYWORD

nonn

AUTHOR

Antti Karttunen (His-Firstname.His-Surname(AT)gmail.com), Jan 03 2004

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 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research