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 A239695 #25 Mar 04 2023 04:27:10
%S A239695 2,3,5,7,3,5,9,3,7,5,7,5,9,11,7,13,11,13,11,15,9,15,3,9,9,5,7,11,5,9,
%T A239695 7,11,9,11,13,15,13,3,7,5,11,5,7,9,13,7,11,15,11,13,17,15,17,11,9,7,
%U A239695 13,7,13,9,11,13,11,15,17,13,11,9,11,13,9,15,15,13,11
%N A239695 Base 9 sum of digits of prime(n).
%C A239695 a(n) is the rank of prime(n) in the base-9 dominance order on the natural numbers.
%H A239695 Vincenzo Librandi, <a href="/A239695/b239695.txt">Table of n, a(n) for n = 1..10000</a>
%H A239695 Tyler Ball and Daniel Juda, <a href="https://scholar.rose-hulman.edu/rhumj/vol14/iss2/2">Dominance over N</a>, Rose-Hulman Undergraduate Mathematics Journal, Vol. 13, No. 2, Fall 2013.
%F A239695 a(n) = A053830(A000040(n)).
%e A239695 The fifth prime is 11, 11 in base 9 is (1,2) so a(5)=1+2=3.
%t A239695 Table[Plus @@ IntegerDigits[Prime[n], 9], {n, 1, 100}] (* _Vincenzo Librandi_, Mar 25 2014 *)
%o A239695 (Sage) [sum(i.digits(base=9)) for i in primes_first_n(200)]
%o A239695 (Magma) [&+Intseq(NthPrime(n),9): n in [1..100]]; // _Vincenzo Librandi_, Mar 25 2014
%o A239695 (PARI) a(n) = sumdigits(prime(n), 9); \\ _Michel Marcus_, Mar 04 2023
%Y A239695 Cf. A007605, A014499, A053830, A239690, A239691, A239692, A239693, A239694.
%K A239695 nonn,base
%O A239695 1,1
%A A239695 _Tom Edgar_, Mar 24 2014