login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A236860
After 0 and 1, numbers n all of whose prime divisors encode an irreducible polynomial over GF(2) (are terms of A091206).
6
0, 1, 2, 3, 4, 6, 7, 8, 9, 11, 12, 13, 14, 16, 18, 19, 21, 22, 24, 26, 27, 28, 31, 32, 33, 36, 37, 38, 39, 41, 42, 44, 47, 48, 49, 52, 54, 56, 57, 59, 61, 62, 63, 64, 66, 67, 72, 73, 74, 76, 77, 78, 81, 82, 84, 88, 91, 93, 94, 96, 97, 98, 99, 103, 104, 108, 109
OFFSET
1,3
COMMENTS
After 0 and 1, positive integers which are products of p * q * ... * r, where p, q, ..., r are terms of A091206.
Also fixed points of A236852(n). Proof: if k is a term of this sequence, the operation described in A236852 reduces to an identity operation. On the other hand, if k is not a term of this sequence, then it has at least one prime divisor which is reducible in polynomial ring GF(2)[X], which is thus "broken" by A236852 (A234742) to two or more separate factors (either prime or not), and because the original factor was prime, and N is a unique factorization domain, the new product computed over the new set of factors (with one or more "broken" pieces) cannot be equal to the original k. (Compare this to how primes are "broken" in a similar way in A235027, also A235145.)
Note: This sequence is not equal to all n for which A234741(n) = A236846(n). The first counterexample occurs at a(325) = 741 (= 3*13*19) for which we have: A236846(741) = 281 (= 3 x 247 = 3 x (13*19)) while A234741(741) = 329 (= 3 x 13 x 19). Contrast this with the behavior of the "dual sequence" A236850, where the corresponding property holds.
LINKS
PROG
(Scheme, with Antti Karttunen's IntSeq-library, two alternative implementations)
(define A236860 (MATCHING-POS 1 0 (lambda (n) (or (zero? n) (every (lambda (p) (= 1 (A091225 p))) (ifactor n))))))
(define A236860 (FIXED-POINTS 1 0 A236852))
(PARI) isp(p) = polisirreducible( Mod(1, 2) * Pol(binary(p))); \\ A091206
isok(n) = if ((n==0), 1 , my(f=factor(n)); prod(k=1, #f~, isp(f[k, 1])) != 0); \\ Michel Marcus, Dec 22 2018
CROSSREFS
Complement: A236848.
Subsequence of A236842.
Fixed points of A236852.
Sequence in context: A020655 A188042 A236842 * A031942 A043090 A317044
KEYWORD
nonn
AUTHOR
Antti Karttunen, Mar 08 2014
STATUS
approved