login
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
OFFSET
1,3
COMMENTS
For n >= 3, a(n) is the largest term of A014580 less than n.
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
KEYWORD
nonn
AUTHOR
Antti Karttunen, Jun 07 2018
STATUS
approved