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

N. J. A. Sloane njas at research.att.com
Mon Sep 5 23:14:44 CEST 2011


Charles, about A107820: I've searched though my correspondence
from 2005, and I can't find any mention of that sequence, sorry.

I agree it doesn't make much sense. If you subtract n from the n-th
term this is what you get:

 [2, 3, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,

    5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,

    5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5]

- which is not very satisfactory.

What if we required the primes we get to be distinct? Then I 
suppose we will get some sequence already in the OEIS.

Neil



More information about the SeqFan mailing list