The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A283991 a(1) = 0 and for n > 1, a(n) = 1 if Stern polynomial B(n,x) is irreducible, 0 otherwise. 10
 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1 COMMENTS Characteristic function for A186891 (apart from term 1, which is here defined as a(1) = 0). LINKS Antti Karttunen, Table of n, a(n) for n = 1..65537 PROG (PARI) \\ After Charles R Greathouse IV's code for A186891. ps(n) = if(n<2, n, if(n%2, ps(n\2)+ps(n\2+1), 'x*ps(n\2))); A283991(n) = polisirreducible(ps(n)); CROSSREFS Cf. A186891, A125184, A260443. Cf. A283992 (partial sums). Differs from A010051 for the first time at n=25: here a(25) = 1. Differs from A257000 for the first time at n=65: here a(65) = 1. Sequence in context: A129950 A010051 A252233 * A327861 A131929 A100821 Adjacent sequences:  A283988 A283989 A283990 * A283992 A283993 A283994 KEYWORD nonn AUTHOR Antti Karttunen, Mar 20 2017 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 June 1 07:40 EDT 2020. Contains 334759 sequences. (Running on oeis4.)