OFFSET
1,1
COMMENTS
We take gpf(1) = 1 by convention.
Except for the initial 2, every member is in A006881.
2^n+1 is never divisible by 23, and when 2^n-1 is divisible by 23, it's also divisible by 89. So 46 cannot occur in the sequence. - Jack Brennen, Jul 23 2014
More generally, let m = A014664(i), i >= 2. If m is odd, 2*A000040(i) occurs in the sequence iff A000040(i) = A006530(2^m-1), in which case it is a(2^m-1). If m is even, 2*A000040(i) occurs in the sequence iff A000040(i) = A006530(2^(m/2)+1), in which case it is a(2^m). - Robert Israel, Jul 24 2014
If a(n) = prime(i)*prime(j), where i < j, then n <= A002072(j). Using this, it can be shown that 3*89 does not occur in the sequence. - Robert Israel, Jul 24 2014
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
MAPLE
gpf:= n -> max(numtheory:-factorset(n)):
gpf(1):= 1:
seq(gpf(n)*gpf(n+1), n=1..100); # Robert Israel, Jul 24 2014
MATHEMATICA
gpf[n_] := FactorInteger[n][[-1, 1]]; f[n_] := gpf[n] gpf[n + 1]; Array[f, 60] (* Robert G. Wilson v, Jul 23 2014 *)
Times@@@Partition[Table[FactorInteger[n][[-1, 1]], {n, 100}], 2, 1] (* Harvey P. Dale, Sep 24 2017 *)
PROG
(PARI) gpf(n)=my(ps); if(n<=1, n, ps=factor(n)[, 1]~; ps[#ps])
a(n) = gpf(n)*gpf(n+1)
CROSSREFS
KEYWORD
nonn,nice
AUTHOR
Franklin T. Adams-Watters, Jul 23 2014
STATUS
approved