OFFSET
0,2
COMMENTS
Note: Start indexing from n=1 if you want just composite numbers. a(0)=1 is the only nonprime, noncomposite in this list.
The first term with three prime divisors is a(11) = 255 = 3*5*17.
The next terms with three prime divisors are
255, 3855, 13107, 21845, 24415, 28527, 30583, 31215, 31611, 31695, 32691, 48059, 56283, 56797, 61935, 65365, 87805, 98005, ...
Of these 24415 (= 5*19*257) is the first one with at least one prime factor that is not a Fermat prime (A019434).
The first term with four prime divisors is a(427) = 65535 = 3*5*17*257.
The first terms which are not multiples of any Fermat prime are: 511, 959, 3647, 4039, 4847, 5371, 7141, 7231, 7679, 7913, 8071, 9179, 12179, ... (511 = 7*73, 959 = 7*137, ...)
LINKS
EXAMPLE
15 = 3*5. When these factors (with binary representations '11' and '101') are multiplied as:
101
1010
----
1111 = 15
we see that the intermediate products 1*5 and 2*5 can be added together without producing any carry-bits (as they have no 1-bits in the same columns/bit-positions), so A048720(3,5) = 3*5 and thus 15 is included in this sequence.
PROG
(Scheme, with Antti Karttunen's IntSeq-library)
(define A235040 (MATCHING-POS 0 1 (lambda (n) (and (odd? n) (not (prime? n)) (= n (reduce A048720bi 1 (ifactor n)))))))
CROSSREFS
KEYWORD
nonn
AUTHOR
Antti Karttunen, Jan 02 2014
STATUS
approved