[seqfan] Re: Slowest increasing sequence where a(n)-n is prime

[Charles Greathouse]

Isn't that A014688?

Charles Greathouse
Analyst/Programmer
Case Western Reserve University

On Mon, Sep 5, 2011 at 5:48 PM, N. J. A. Sloane <njas at research.att.com> wrote:
> Bob, you said:
>
> Neil,
>
>    How about
> {3, 5, 8, 11, 16, 19, 24, 27, 32, 39, 42, 49, 54, 57, 62, 69, 76, 79, 86,
> 91, 94, 101, 106, 113, 122, 127, 130, 135, 138, 143, 158, 163, 170, 173,
> 184, 187, 194, 201, 206, 213, 220, 223, 234, 237, 242, 245, 258, 271, 276,
> 279}
> f[s_List] := Block[{k = 1, m = Last at s, n = Length@ s}, While[k < m + 2 || !
> PrimeQ[k - n], k++]; Append[s, k]]; Rest@ Nest[f, {0}, 50]
>
>    Each term exceeds the previous term by at least 3.
>
>
> Looks good! If no one else has a better suggestion, Bob,
> would you go ahead and edit that sequence? Better wait until tomorrow,
> just in case someone can recall the original discussion.
>
> Thanks
>
> Neil.
>
> _______________________________________________
>
> Seqfan Mailing list - http://list.seqfan.eu/
>