[seqfan] Re: A245486

Charles Greathouse charles.greathouse at case.edu
Thu Jul 24 01:40:34 CEST 2014


Well, with Catalan's conjecture I can prove that a(n) > 6 for n > 8. Your
full conjecture seems pretty far from resolution to me.

Charles Greathouse
Analyst/Programmer
Case Western Reserve University


On Wed, Jul 23, 2014 at 5:59 PM, Frank Adams-Watters <franktaw at netscape.net>
wrote:

> I have a new sequence in editing state: https://oeis.org/draft/A245486 -
> Greatest prime factor of n times greatest prime factor of n+1.
>
> 1) I think it's the case that recent results show that this sequence goes
> to infinity; equivalently, each member of A006881(products of 2 distinct
> primes) occurs only finitely many times. Can someone confirm this?
>
> 2) I can almost prove that every member of A006881 does occur in this
> sequence. Can anyone find a proof? (Or a counterexample.)
>
> Franklin T. Adams-Watters
>
> _______________________________________________
>
> Seqfan Mailing list - http://list.seqfan.eu/
>



More information about the SeqFan mailing list