A344946 x -> prime(x) iterated prime(n) times, evaluated at n.

3, 11, 709, 167449, 88362852307, 156740126985437, 1172447586903041169661

Offset

1,1

Links

Table of n, a(n) for n=1..7.

Formula

a(n) = prime^{prime(n)}(n), with prime^{0}(n) = n and prime^{k}(n) = prime(prime^{k-1}(n)) for 1 <= k <= prime(n).

a(n) = prime(prime(...(n))) {prime(n) times}.

Example

a(1) = prime(prime(1)) = 3.
a(2) = prime(prime(prime(2))) = 11.
a(3) = prime(prime(prime(prime(prime(3))))) = 709.

Mathematica

nterms=6; Table[Nest[Prime[#]&, n, Prime[n]], {n, nterms}]

Prog

(Python)
from sympy import prime
def a(n):
  iter = pn = prime(n)
  for i in range(1, pn): iter = prime(iter)
  return iter
print([a(n) for n in range(1, 6)]) # Michael S. Branicky, Jun 03 2021
(PARI) a(n) = my(p = n); for (k=1, prime(n), p=prime(p)); p; \\ Michel Marcus, Jun 03 2021

Crossrefs

Cf. A000040, A058009.

Sequence in context: A264725 A374558 A088579 * A368618 A374718 A006938

Adjacent sequences: A344943 A344944 A344945 * A344947 A344948 A344949

Keyword

nonn,more,hard

Author

Paolo Xausa, Jun 03 2021

Extensions

a(7) from Jinyuan Wang, Jul 12 2021

Status

approved