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 A374150 #8 Jun 29 2024 10:53:19 %S A374150 3,5,17,67,241,739,2063,5441,13693,34351,83617,198479,465337,1076401, %T A374150 2461873,5582917,12548171,28018649,62133769,137034913,300736621, %U A374150 656953343,1429360349,3098240417,6692967079,14414137427,30952936639,66293412113,141636592337,301924957273 %N A374150 a(n) is the (2^n)-th prime-indexed prime. %C A374150 The data was calculated using Kim Walisch's primecount program. %H A374150 Amiram Eldar, <a href="/A374150/b374150.txt">Table of n, a(n) for n = 0..52</a> %H A374150 Kim Walisch, <a href="https://github.com/kimwalisch/primecount">Fast C++ prime counting function implementation (primecount)</a>. %H A374150 Wikipedia, <a href="https://en.wikipedia.org/wiki/Super-prime">Super-prime</a>. %F A374150 a(n) = A006450(2^n). %F A374150 a(n) = A000040(A033844(n)). %e A374150 a(0) = 3 since prime(prime(2^0)) = prime(prime(1)) = prime(2) = 3. %e A374150 a(1) = 5 since prime(prime(2^1)) = prime(prime(2)) = prime(3) = 5. %t A374150 Table[Prime[Prime[2^n]], {n, 0, 30}] %o A374150 (PARI) a(n) = prime(prime(2^n)); %Y A374150 Cf. A000040, A006450, A033844, A092252, A374151. %K A374150 nonn %O A374150 0,1 %A A374150 _Amiram Eldar_, Jun 29 2024