Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A091245
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A091245 Number of reducible GF(2)[X]-polynomials in range [0,n]. +0
3
0, 0, 0, 0, 1, 2, 3, 3, 4, 5, 6, 6, 7, 7, 8, 9, 10, 11, 12, 12, 13, 14, 15, 16, 17, 17, 18, 19, 20, 21, 22, 22, 23, 24, 25, 26, 27, 27, 28, 29, 30, 30, 31, 32, 33, 34, 35, 35, 36, 37, 38, 39, 40, 41, 42, 42, 43, 44, 45, 45, 46, 46, 47, 48, 49, 50, 51, 51, 52, 53, 54, 55, 56, 56 (list; graph; listen)
OFFSET

0,6

COMMENT

Analogous to A065855.

LINKS

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

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

EXAMPLE

In range [0,8] there are the following four reducible polynomials: 4,5,6,8 thus a(8) = 4.

CROSSREFS

Partial sums of A091247. Cf. A091242.

Sequence in context: A132351 A025556 A005229 this_sequence A100618 A061288 A086525

Adjacent sequences: A091242 A091243 A091244 this_sequence A091246 A091247 A091248

KEYWORD

nonn

AUTHOR

Antti Karttunen (His-Firstname.His-Surname(AT)iki.fi), 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 December 10 00:48 EST 2009. Contains 170565 sequences.


AT&T Labs Research