|
%I #7 May 14 2015 15:48:56
%S 1,25,55,69,77,81,87,91,115,117,121,143,145,169,171,185,203,205,209,
%T 213,247,253,261,265,275,285,289,295,299,301,305,319,321,323,327,329,
%U 333,339,351,355,357,361,369,375,377,391,395,405,407,415,425,437
%N Nonprimes in A206074 (a coding of irreducible polynomials).
%H Charles R Greathouse IV, <a href="/A206075/b206075.txt">Table of n, a(n) for n = 1..10000</a>
%e Under the coding of irreducible polynomials over {0,1} which is given at A206074, the polynomials matching the first five terms of A206075 are indicated here:
%e 1 .... 1
%e 25 ... x^4 + x^3 + 1
%e 55 ... x^5 + x^4 + x^2 + x + 1
%e 69 ... x^6 + x^2 + 1
%e 77 ... x^6 + x^3 + x^2 + 1
%t t = Table[IntegerDigits[n, 2], {n, 1, 1500}];
%t b[n_] := Reverse[Table[x^k, {k, 0, n}]]
%t p[n_, x_] := t[[n]].b[-1 + Length[t[[n]]]]
%t u = {1}; Do[n++; If[IrreduciblePolynomialQ[p[n, x]], AppendTo[u, n]], {n, 1000}]
%t nonprimes = Complement[Range[800], Table[Prime[n], {n, 1, 800}]];
%t Intersection[u, nonprimes] (* A206075 *)
%o (PARI) is(n)=n==1 || (polisirreducible( Pol(binary(n)) ) && !isprime(n)) \\ _Charles R Greathouse IV_, May 14 2015
%Y Cf. A206074.
%K nonn
%O 1,2
%A _Clark Kimberling_, Feb 03 2012
|
