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