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 A258877 #14 Jun 19 2015 16:43:11
%S A258877 97,131,199,263,349,457,479,521,541,617,661,733,829,839,881,1039,1049,
%T A258877 1091,1103,1277,1289,1301,1361,1433,1487,1499,1549,1571,1759,1913,
%U A258877 1933,1993,2089,2099,2129,2141,2221,2273,2357,2377,2389,2441
%N A258877 Primes p=prime(m) such that both p and m have the same digital root.
%F A258877 a(n) = A000040(A258876(n)).
%e A258877 Both 97 = prime(25) and 25 have digital root = 7,
%e A258877 both 131 = prime(32) and 32 have digital root = 5.
%t A258877 Reap[Do[If[FixedPoint[Total[IntegerDigits[#]]&,n]==Mod[(p=Prime[n]),9],Sow[p]],{n,439}]][[2,1]]
%t A258877 Prime[Select[Range@370,Mod[#,9]==Mod[Prime[#],9]&]] (* _Ivan N. Ianakiev_, Jun 18 2015 *)
%Y A258877 Cf. A000040, A010888, A038194, A258876.
%K A258877 nonn,base
%O A258877 1,1
%A A258877 _Zak Seidov_, Jun 13 2015