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 A258876 #19 Jul 07 2025 18:48:32
%S A258876 25,32,46,56,70,88,92,98,100,113,121,130,145,146,152,175,176,182,185,
%T A258876 206,209,212,218,227,236,239,244,248,274,293,295,301,316,317,320,323,
%U A258876 331,338,350,352,355,362,377,386,394,397,398,406,409,413,439
%N A258876 Integers k such that both k and prime(k) have the same digital root.
%C A258876 Integers k such that A010888(k) = A038194(k).
%C A258876 Conjecture: a(n) ~ 9n. - _Charles R Greathouse IV_, Jun 17 2015
%H A258876 Charles R Greathouse IV, <a href="/A258876/b258876.txt">Table of n, a(n) for n = 1..10000</a>
%e A258876 Both 25 and prime(25) = 97 have 7 for a digital root.
%e A258876 Both 32 and prime(32) = 131 have 5 for a digital root.
%t A258876 Reap[Do[If[FixedPoint[Total[IntegerDigits[#]] &, n] == Mod[Prime[n], 9], Sow[n]], {n, 439}]][[2, 1]] (* Seidov *)
%t A258876 Select[Range[500], Mod[#, 9] == Mod[Prime[#], 9] &] (* _Alonso del Arte_, Jun 17 2015 *)
%o A258876 (PARI) isok(n) = (n % 9) == (prime(n) % 9); \\ _Michel Marcus_, Jun 17 2015
%o A258876 (PARI) n=0; forprime(p=2,1e4, if((p-n++)%9==0, print1(n", "))) \\ _Charles R Greathouse IV_, Jun 17 2015
%Y A258876 Cf. A010888, A038194.
%K A258876 base,nonn
%O A258876 1,1
%A A258876 _Zak Seidov_, Jun 13 2015