login
A253785
Composite numbers n = prime(i_1) * ... * prime(i_k), prime(i_1) <= prime(i_2) <= ... <= prime(i_k), with at least one pair of successive prime factors (when sorted into monotonic order) where the latter prime factor is greater than the square of the former: prime(i_x)^2 < prime(i_{x+1}), for some x in 1 .. k-1, where k = A001222(n) and i_k = A061395(n).
3
10, 14, 20, 22, 26, 28, 33, 34, 38, 39, 40, 44, 46, 50, 51, 52, 56, 57, 58, 62, 66, 68, 69, 70, 74, 76, 78, 80, 82, 86, 87, 88, 92, 93, 94, 98, 99, 100, 102, 104, 106, 110, 111, 112, 114, 116, 117, 118, 122, 123, 124, 129, 130, 132, 134, 136, 138, 140, 141, 142, 145, 146, 148, 152, 153, 154, 155, 156, 158, 159, 160, 164, 166, 170
OFFSET
1,1
LINKS
EXAMPLE
10 = 2*5 is present as 2^2 < 5.
50 = 2*5*5 is present as 2^2 < 5.
51 = 3*17 is present as 3^2 < 17.
66 = 2*3*11 is present as 3^2 < 11.
PROG
(Scheme, with Antti Karttunen's IntSeq-library)
(define A253785 (MATCHING-POS 1 1 (lambda (n) (not (numbers-densely-distributed? (ifactor n))))))
(define (numbers-densely-distributed? lista) (cond ((null? lista) #t) ((null? (cdr lista)) #t) ((< (A000290 (car lista)) (cadr lista)) #f) (else (numbers-densely-distributed? (cdr lista)))))
CROSSREFS
Complement: A253784.
Subsequences: A138511, A253569.
Differs from A245729 for the first time at n=14, where a(14) = 50, while A245729(14) = 51.
Sequence in context: A272374 A362982 A251727 * A245729 A031274 A272375
KEYWORD
nonn
AUTHOR
Antti Karttunen, Jan 16 2015
STATUS
approved