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!)
A305419 Largest k < n whose binary expansion encodes an irreducible (0,1)-polynomial over GF(2)[X], with a(1) = a(2) = 1. 10

%I #8 Jun 08 2018 13:52:27

%S 1,1,2,3,3,3,3,7,7,7,7,11,11,13,13,13,13,13,13,19,19,19,19,19,19,25,

%T 25,25,25,25,25,31,31,31,31,31,31,37,37,37,37,41,41,41,41,41,41,47,47,

%U 47,47,47,47,47,47,55,55,55,55,59,59,61,61,61,61,61,61,67,67,67,67,67,67,73,73,73,73,73,73,73,73,73,73,73,73,73,73,87

%N Largest k < n whose binary expansion encodes an irreducible (0,1)-polynomial over GF(2)[X], with a(1) = a(2) = 1.

%C For n >= 3, a(n) is the largest term of A014580 less than n.

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

%H <a href="/index/Ge#GF2X">Index entries for sequences related to polynomials in ring GF(2)[X]</a>

%o (PARI)

%o A091225(n) = polisirreducible(Pol(binary(n))*Mod(1, 2));

%o A305419(n) = if(n<3,1, my(k=n-1); while(k>1 && !A091225(k),k--); (k));

%Y Cf. A014580, A091225, A305420, A305422.

%Y Cf. also A151799 (A136548), A305429.

%K nonn

%O 1,3

%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 April 18 22:18 EDT 2024. Contains 371782 sequences. (Running on oeis4.)