The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A235035 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. 12
 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, 47, 48, 50, 52, 55, 56, 59, 61, 62, 64, 67, 73, 74, 76, 82, 87, 88, 91, 94, 96, 97, 100, 103, 104, 109, 110, 111, 112, 115, 117, 118, 122, 123, 124, 128, 131, 134, 137 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS Antti Karttunen, Table of n, a(n) for n = 1..10000 PROG (Scheme, with Antti Karttunen's IntSeq-library) (define A235035 (MATCHING-POS 1 0 (lambda (n) (or (zero? n) (= n (reduce * 1 (GF2Xfactor n))))))) CROSSREFS Gives the positions of zeros in A236379, i.e., n such that A234742(n) = n. An intersection with A235034 gives A235032. Contains A014580 as a subsequence. Cf. A235036, A235032-A235033, A234742. Sequence in context: A328592 A175413 A192048 * A235045 A235032 A242925 Adjacent sequences:  A235032 A235033 A235034 * A235036 A235037 A235038 KEYWORD nonn AUTHOR Antti Karttunen, Jan 02 2014 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 6 01:16 EDT 2020. Contains 334858 sequences. (Running on oeis4.)