%I #10 Aug 19 2019 16:04:05
%S 1,1,1,2,1,1,4,3,2,1,3,7,3,2,1,5,3,3,2,3,13,2,11,4,3,5,9,3,24,7,19,1,
%T 1,18,9,6,25,9,4,13,13,38,2,21,11,6,11,37,9,16,15,31,10,9,33,8,18,2,
%U 37,1,5,3,29,57,11,21,29,21,52,27,53
%N Values of k corresponding to A073726.
%C If there is more than one choice for k then the smallest value is taken.
%H A. J. Menezes, P. C. van Oorschot and S. A. Vanstone, <a href="http://www.cacr.math.uwaterloo.ca/hac/">Handbook of Applied Cryptography</a>, CRC Press, 1996; see Table 4.8.
%t f[n_] := For[k = 1, k <= n - 1, k++, If[PrimitivePolynomialQ[x^n + x^k + 1, 2], Print[k]; Return[k]]];
%t DeleteCases[f /@ Range[201], Null] (* _Jean-François Alcover_, Aug 19 2019 *)
%K nonn,easy
%O 1,4
%A _N. J. A. Sloane_, Sep 06 2002
%E a(12) - a(71) from _Nathaniel Johnston_, Apr 26 2011
|