|
%I #23 Aug 02 2015 17:51:58
%S 1,4,6,8,9,10,12,14,15,16,18,20,21,22,24,26,27,28,30,32,33,34,35,36,
%T 38,39,40,42,44,45,46,48,49,50,51,52,54,56,57,58,60,62,63,64,65,66,68,
%U 70,72,74,75,76,78,80,82,84,85,86,88,90,92,93,94,95,96,98,99,100
%N Complement of A206074, a coding of reducible polynomials over Q (with coefficients 0 or 1).
%C Reducibility here refers to the field of rational numbers.
%C Except for its initial 3, is A039004 a subsequence of A205783?
%H Antti Karttunen, <a href="/A205783/b205783.txt">Table of n, a(n) for n = 1..21951</a>
%F Other identities and observations. For all n >= 1:
%F A255573(a(n)) = n.
%e The reducible polynomials matching the first four terms:
%e 1 = 1(base 2) matches 1
%e 4 = 100(base 2) matches x^2
%e 6 = 110(base 2) matches x^2 + x
%e 8 = 1000(base 2) matches x^3
%e 9 = 1001(base 2) matches x^3 + 1
%t t = Table[IntegerDigits[n, 2], {n, 1, 850}];
%t b[n_] := Reverse[Table[x^k, {k, 0, n}]]
%t p[n_, x_] := t[[n]].b[-1 + Length[t[[n]]]]
%t Table[p[n, x], {n, 1, 15}]
%t u = {}; Do[n++; If[IrreduciblePolynomialQ[p[n, x]],
%t AppendTo[u, n]], {n, 300}];
%t u (* A206074 *)
%t Complement[Range[200], u] (* A205783 *)
%t b[n_] := FromDigits[IntegerDigits[u, 2][[n]]]
%t Table[b[n], {n, 1, 40}] (* A206073 *)
%o (PARI)
%o isA205783(n) = ((n > 0) && !polisirreducible(Pol(binary(n))));
%o n = 0; i = 0; while(n < 32768, n++; if(isA205783(n), i++; write("b205783.txt", i, " ", n)));
%o \\ _Antti Karttunen_, Jul 28 2015 after _Joerg Arndt_'s code for A206074.
%Y Cf. A206074 (complement), A255573 (left inverse).
%Y After 1 a subsequence of A091212 (69 is the first term missing from here).
%Y Cf. also permutations A260421 - A260426.
%K nonn
%O 1,2
%A _Clark Kimberling_, Feb 03 2012
|
