login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A136379 Number of irreducible polynomials (counted with multiplicity) dividing A036284(n), when it is considered as a GF(2)[X]-polynomial. 1
2, 4, 9, 17, 25, 42, 76, 143, 273, 533, 1052, 2072, 4122, 8221, 16417, 32799 (list; graph; refs; listen; history; internal format)
OFFSET

0,1

LINKS

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

A. Karttunen, C program for computing this sequence

CROSSREFS

a(n) = A091222(A036284(n)).

Sequence in context: A060401 A063981 A131095 * A065026 A199205 A192967

Adjacent sequences:  A136376 A136377 A136378 * A136380 A136381 A136382

KEYWORD

nonn

AUTHOR

Antti Karttunen (His_Firstname.His_Surname(AT)gmail.com), Dec 29 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 09:41 EST 2012. Contains 206009 sequences.