Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A136378
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A136378 Number of distinct irreducible polynomials dividing A036284(n), when it is considered as a GF(2)[X]-polynomial. +0
2
2, 2, 3, 4, 5, 5, 5, 7, 7, 10, 15, 10, 10, 12, 15, 11 (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) = A091221(A036284(n)).

Sequence in context: A054633 A072490 A085972 this_sequence A099249 A050296 A057062

Adjacent sequences: A136375 A136376 A136377 this_sequence A136379 A136380 A136381

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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research