OFFSET
1,2
FORMULA
For n>=2, a(n) = a(n-1) + pi(2^(2^(n-1))), where pi(x) is the prime counting function.
For s>1, Product_{n>=1} (1 + A050376(a(n))^(-s)) = 2^s/(2^s-1).
MATHEMATICA
a[1] = 1; a[n_] := a[n] = a[n - 1] + PrimePi[2^(2^(n - 1))]; Array[a, 6] (* Amiram Eldar, Dec 04 2018 *)
PROG
(PARI) a(n) = if (n==1, 1, a(n-1) + primepi(2^(2^(n-1)))); \\ Michel Marcus, Dec 04 2018
(Python)
from sympy import primepi
def A228776(n): return sum(primepi(1<<(1<<i)) for i in range(n)) # Chai Wah Wu, Feb 18 2025
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Vladimir Shevelev, Sep 04 2013
EXTENSIONS
a(6) from Peter J. C. Moses
a(7) from Jinyuan Wang, Mar 03 2020
STATUS
approved