gabriel vizena

Notation:
n - integer value
p, t: subset of Z -> other subset of Z
p(n) is the n-th prime number for n > 0.
t(n) = p(n + 1) - p(n) for n > 0.

In essence the question is whether it is possible to exist recursive
construction for p(n) or t(n) similar to these for the Q and D numbers
- http://mathworld.wolfram.com/HofstadtersQ-Sequence.html

"similar" means computationally stable recursive expression for p(n) or
t(n) which contains only constant number of:
compositions with p or t resp. and +, - only
integer constants
the variable n

For n <= 0 there is only a constant number of predefined (initial)
values for p(n) and t(n). (for example: t(-1) = 1, t(0) = 0)

Thank you
Gabriel

(If something is not clear the moderators are free to correct/comment
it.)