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 A239694 #22 Mar 04 2023 04:27:00
%S A239694 2,3,5,7,4,6,3,5,9,8,10,9,6,8,12,11,10,12,4,8,3,9,6,5,6,10,12,9,11,8,
%T A239694 15,5,4,6,9,11,10,9,13,12,11,13,16,4,8,10,8,13,10,12,9,15,10,13,5,11,
%U A239694 10,12,11,8,10,13,13,17,12,16,9,8,11,13,10,16,17,16
%N A239694 Base 8 sum of digits of prime(n).
%C A239694 a(n) is the rank of prime(n) in the base-8 dominance order on the natural numbers.
%H A239694 Vincenzo Librandi, <a href="/A239694/b239694.txt">Table of n, a(n) for n = 1..10000</a>
%H A239694 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 A239694 a(n) = A053829(A000040(n)).
%e A239694 The sixth prime is 13, 13 in base 8 is (1,5) so a(6)=1+5=6.
%t A239694 Table[Plus @@ IntegerDigits[Prime[n], 8], {n, 1, 100}] (* _Vincenzo Librandi_, Mar 25 2014 *)
%o A239694 (Sage) [sum(i.digits(base=8)) for i in primes_first_n(200)]
%o A239694 (Magma) [&+Intseq(NthPrime(n),8): n in [1..100]]; // _Vincenzo Librandi_, Mar 25 2014
%o A239694 (PARI) a(n) = sumdigits(prime(n), 8); \\ _Michel Marcus_, Mar 04 2023
%Y A239694 Cf. A007605, A014499, A053829, A239690, A239691, A239692, A239693.
%K A239694 nonn,base
%O A239694 1,1
%A A239694 _Tom Edgar_, Mar 24 2014