The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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
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, 25, 25, 25, 25, 25, 31, 31, 31, 31, 31, 31, 37, 37, 37, 37, 41, 41, 41, 41, 41, 41, 47, 47, 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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
COMMENTS
For n >= 3, a(n) is the largest term of A014580 less than n.
LINKS
PROG
(PARI)
A091225(n) = polisirreducible(Pol(binary(n))*Mod(1, 2));
A305419(n) = if(n<3, 1, my(k=n-1); while(k>1 && !A091225(k), k--); (k));
CROSSREFS
Cf. also A151799 (A136548), A305429.
Sequence in context: A111913 A354142 A210796 * A075757 A096420 A096193
KEYWORD
nonn
AUTHOR
Antti Karttunen, Jun 07 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 15 03:12 EDT 2024. Contains 373402 sequences. (Running on oeis4.)