[seqfan] Re: A055498

[Sean A. Irvine]

Hi Christopher,

Is your question right?

For n=3, we have A055498(3)=nextprime(1+2)=3, but since gcd(3,3)=3, your k
needs to be 4, which is already different?

Likewise when we have 3, 5, the rule for A055498 produces 11, but the
smallest k in your procedure would be 9.

Sean.


On Fri, 9 Jul 2021 at 16:31, Christopher Hohl via SeqFan <
seqfan at list.seqfan.eu> wrote:

> Hi everyone!  I was just wondering if A055498 (a(0)=0, a(1)=1, a(n)=
> smallest prime >= a(n-1)+a(n-2)) is different from: a(0)=a(1)=1, a(n) =
> least k >= a(n-1)+a(n-2) such that gcd(k,a(n-1)+a(n-2))=1?  That is,
> excluding a(0)=1.  I can't go much higher than I have (by hand), but
> everything looks to be the same between the two sequences for small n.
> This is (of course) relatively meaningless, so if anyone cares to check for
> greater n, thank you in advance!
> --Christopher Hohl
>
> Sent from Yahoo Mail on Android
>
> --
> Seqfan Mailing list - http://list.seqfan.eu/
>