|
%I #14 Feb 05 2014 10:55:33
%S 0,1,2,3,4,6,7,8,11,12,13,14,16,19,22,24,25,26,28,31,32,37,38,41,44,
%T 47,48,50,52,55,56,59,61,62,64,67,73,74,76,82,87,88,91,94,96,97,100,
%U 103,104,109,110,111,112,115,117,118,122,123,124,128,131,134,137
%N Numbers n for which A234742(n) = n: numbers n whose binary representation encodes a GF(2)[X]-polynomial such that when its irreducible factors are multiplied together as ordinary integers (with carry-bits), the result is n.
%H Antti Karttunen, <a href="/A235035/b235035.txt">Table of n, a(n) for n = 1..10000</a>
%H <a href="/index/Ge#GF2X">Index entries for sequences operating on (or containing) GF(2)[X]-polynomials</a>
%o (Scheme, with _Antti Karttunen_'s IntSeq-library)
%o (define A235035 (MATCHING-POS 1 0 (lambda (n) (or (zero? n) (= n (reduce * 1 (GF2Xfactor n)))))))
%Y Gives the positions of zeros in A236379, i.e., n such that A234742(n) = n.
%Y An intersection with A235034 gives A235032. Contains A014580 as a subsequence.
%Y Cf. A235036, A235032-A235033, A234742.
%K nonn
%O 1,3
%A _Antti Karttunen_, Jan 02 2014
|
