login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A305430 Smallest k > n whose binary expansion encodes an irreducible (0,1)-polynomial over Q. 4

%I #10 Dec 20 2021 09:47:09

%S 2,3,5,5,7,7,11,11,11,11,13,13,17,17,17,17,19,19,23,23,23,23,25,25,29,

%T 29,29,29,31,31,37,37,37,37,37,37,41,41,41,41,43,43,47,47,47,47,53,53,

%U 53,53,53,53,55,55,59,59,59,59,61,61,67,67,67,67,67,67,69,69,71,71,73,73,77,77,77,77,79,79,81,81,83,83,87,87,87,87,89,89

%N Smallest k > n whose binary expansion encodes an irreducible (0,1)-polynomial over Q.

%C a(n) is the smallest term of A206074 greater than n.

%H Antti Karttunen, <a href="/A305430/b305430.txt">Table of n, a(n) for n = 1..21845</a>

%t binPol[n_, x_] := With[{bb = IntegerDigits[n, 2]},bb.x^Range[Length[bb]-1, 0, -1]];

%t b[n_] := If[IrreduciblePolynomialQ[binPol[n, x]], 1, 0];

%t a[n_] := Module[{k = n+1}, While[b[k] == 0, k++]; k];

%t Array[a, 100] (* _Jean-François Alcover_, Dec 20 2021 *)

%o (PARI)

%o A257000(n) = polisirreducible(Pol(binary(n)));

%o A305430(n) = { my(k=1+n); while(!A257000(k),k++); (k); };

%Y Cf. A206074, A257000, A305429.

%Y Cf. also A151800, A305420.

%K nonn

%O 1,1

%A _Antti Karttunen_, Jun 07 2018

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 9 18:53 EDT 2024. Contains 372354 sequences. (Running on oeis4.)