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

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A091225 Characteristic function of A014580: 1 if the n-th GF(2)[X] polynomial is irreducible, 0 otherwise. 36
0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

LINKS

Table of n, a(n) for n=0..101.

A. Karttunen, Scheme-program for computing this sequence

Index entries for characteristic functions

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

PROG

(PARI) a(n) = polisirreducible(Pol(binary(n))*Mod(1, 2)); \\ Michel Marcus, Nov 11 2017

CROSSREFS

a(n) = A010051(A091203(n)) = A010051(A091205(n)). Partial sums give A091226. Cf. A091227. Complementary to A091247.

Sequence in context: A011656 A043545 A094754 * A175337 A132380 A021913

Adjacent sequences:  A091222 A091223 A091224 * A091226 A091227 A091228

KEYWORD

nonn,changed

AUTHOR

Antti Karttunen, Jan 03 2004

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified November 20 08:12 EST 2017. Contains 294962 sequences.