OFFSET
1,2
COMMENTS
In other words, for any distinct m and n, let a(m)/a(n) = u/v in reduced form, then bigomega(u) + bigomega(v) >= 3 (where bigomega corresponds to A001222(n), the number of distinct prime factors of n with multiplicity).
The variant where distinct terms differ by at least 1 prime factor simply corresponds to the positive numbers.
The variant where distinct terms differ by at least 2 prime factors corresponds to A028260.
No term is prime nor the square of a prime.
LINKS
Rémy Sigrist, Table of n, a(n) for n = 1..10000
Rémy Sigrist, C program for A335440
EXAMPLE
The first terms, alongside their p-adic valuations for p = 2..11 (with dots instead of zeros), are:
n a(n) v2 v3 v5 v7 v11
-- ---- -- -- -- -- ---
1 1 . . . . .
2 8 3 . . . .
3 18 1 2 . . .
4 50 1 . 2 . .
5 60 2 1 1 . .
6 64 6 . . . .
7 81 . 4 . . .
8 98 1 . . 2 .
9 105 . 1 1 1 .
10 144 4 2 . . .
11 225 . 2 2 . .
12 242 1 . . . 2
13 308 2 . . 1 1
PROG
(C) See Links section.
CROSSREFS
KEYWORD
nonn
AUTHOR
Rémy Sigrist, Jun 10 2020
STATUS
approved