This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A374151 #7 Jun 29 2024 10:58:38
%S A374151 0,0,1,2,3,5,7,11,16,25,39,63,103,172,290,490,844,1464,2564,4522,8022,
%T A374151 14325,25686,46382,84115,153327,280423,514798,948374,1752639,3248574,
%U A374151 6037968,11250482,21013808,39336188,73788697,138689231,261150360,492602752,930716294
%N A374151 The number of prime-indexed primes below 2^n.
%C A374151 The data was calculated using Kim Walisch's primecount program.
%H A374151 Amiram Eldar, <a href="/A374151/b374151.txt">Table of n, a(n) for n = 0..77</a>
%H A374151 Kim Walisch, <a href="https://github.com/kimwalisch/primecount">Fast C++ prime counting function implementation (primecount)</a>.
%H A374151 Wikipedia, <a href="https://en.wikipedia.org/wiki/Super-prime">Super-prime</a>.
%F A374151 a(n) = A000720(A007053(n)).
%F A374151 a(n) = A132090(2^n).
%e A374151 a(1) = 0 since primepi(primepi(2^1)) = primepi(primepi(2)) = primepi(1) = 0.
%e A374151 a(2) = 1 since primepi(primepi(2^2)) = primepi(primepi(4)) = primepi(2) = 1.
%t A374151 Table[PrimePi[PrimePi[2^n]], {n, 0, 40}]
%o A374151 (PARI) a(n) = primepi(primepi(2^n));
%Y A374151 Cf. A000720, A006450, A007053, A096359, A374150.
%K A374151 nonn
%O A374151 0,4
%A A374151 _Amiram Eldar_, Jun 29 2024