OFFSET
1,3
COMMENTS
We use the convention that an empty product is 1.
By decree, gcd(S(n+1),p(n)) = 1, gcd(S(n+1),q(n)) = q(n) = p(n+1), S(n+1) >= r(n).
By definition, all terms are squarefree. Let {i,j,k} be distinct fixed positive numbers. Conjecture: All squarefree numbers appear infinitely often, and all terms a(n) = j are immediately preceded and followed infinitely often by all terms a(n-1) = i and a(n+1) = k. If so, then A280864 is a permutation of the natural numbers. - Bob Selcoe, Apr 04 2017
LINKS
Rémy Sigrist, Table of n, a(n) for n = 1..100000
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Jan 12 2017
EXTENSIONS
More terms from Rémy Sigrist, Jan 14 2017
STATUS
approved