|
| |
|
|
A116889
|
|
a(n) is the least prime p that remains prime through n iterations of function f(p)=p^2+4.
|
|
3
| | |
|
|
|
OFFSET
| 0,1
|
|
|
COMMENTS
| The sequence is finite, since it can be proved that if p, f(p), f(f(p)), f(f(f(p))) and f(f(f(f(p)))) are all primes, then the next iteration gives a multiple of 13, greater than 13, thus a(k) for k>=5 does not exist.
|
|
|
EXAMPLE
| a(0)=2 since f(2)=6 is not prime. a(1)=a(2)=3 since both f(3)=13 and f(f(3))=173 are primes.
|
|
|
CROSSREFS
| Cf. A062324, A116886, A116887, A116888.
Sequence in context: A096502 A101462 A088266 * A037847 A037883 A023868
Adjacent sequences: A116886 A116887 A116888 * A116890 A116891 A116892
|
|
|
KEYWORD
| fini,full,nonn
|
|
|
AUTHOR
| Giovanni Resta (g.resta(AT)iit.cnr.it), Feb 27 2006
|
| |
|
|
