This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A305816 a(n) = 1 if n is a prime whose binary expansion encodes a (0,1)-polynomial which is irreducible when factored over GF(2), 0 otherwise. 4
 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 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, 0, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1 COMMENTS Characteristic function of A091206. LINKS Antti Karttunen, Table of n, a(n) for n = 1..65537 FORMULA a(n) = A010051(n)*A091225(n). a(n) = [A305789(n) == 2]. PROG (PARI) A305816(n) = (isprime(n)&&polisirreducible(Pol(binary(n))*Mod(1, 2))); CROSSREFS Cf. A091206, A305802, A305789, A305817 (partial sums), A305904. Sequence in context: A284901 A071981 A280910 * A241979 A200244 A261185 Adjacent sequences:  A305813 A305814 A305815 * A305817 A305818 A305819 KEYWORD nonn AUTHOR Antti Karttunen, Jun 15 2018 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 9 17:18 EST 2019. Contains 329879 sequences. (Running on oeis4.)