Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A136379
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A136379 Number of irreducible polynomials (counted with multiplicity) dividing A036284(n), when it is considered as a GF(2)[X]-polynomial. +0
2
2, 4, 9, 17, 25, 42, 76, 143, 273, 533, 1052, 2072, 4122, 8221, 16417, 32799 (list; graph; listen)
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 this_sequence A065026 A007502 A088039

Adjacent sequences: A136376 A136377 A136378 this_sequence A136380 A136381 A136382

KEYWORD

nonn

AUTHOR

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

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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research