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 A344948 #11 Jun 06 2021 10:25:38
%S A344948 2,3,5,19,29,47,67,73,101,113,137,167,193,199,239,263,313,349,389,419,
%T A344948 431,449,461,487,571,599,641,701,719,751,797,823,857,887,911,977,991,
%U A344948 1019,1097,1193,1223,1231,1277,1301,1307,1399,1439,1481,1511,1531,1571,1601
%N A344948 Primes whose position among the powers of primes (A000961) is also prime.
%H A344948 Michel Marcus, <a href="/A344948/b344948.txt">Table of n, a(n) for n = 1..10000</a>
%e A344948 The position of 2 in A000961 is 2; so 2 is a term.
%e A344948 The position of 19 in A000961 is 13; so 19 is a term.
%t A344948 pow = Select[Range[1600], # == 1 || PrimePowerQ[#] &]; Select[pow[[Select[Range @ Length[pow], PrimeQ]]], PrimeQ] (* _Amiram Eldar_, Jun 03 2021 *)
%o A344948 (PARI) allmps(nn) = {my(map = Map()); mapput(map, 1, 1); my(nb=1); for (n=2, nn, if (isprimepower(n), nb++; mapput(map, n, nb));); map;}
%o A344948 lista(nn) = {my(nb = prime(nn), map = allmps(nb)); forprime (p=1, nn, if( isprime(mapget(map, p)), print1(p, ", ")););}
%Y A344948 Cf. A000040, A000961, A024620.
%K A344948 nonn
%O A344948 1,1
%A A344948 _Michel Marcus_, Jun 03 2021