login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A239691
Base 5 sum of digits of prime(n).
5
2, 3, 1, 3, 3, 5, 5, 7, 7, 5, 3, 5, 5, 7, 7, 5, 7, 5, 7, 7, 9, 7, 7, 9, 9, 5, 7, 7, 9, 9, 3, 3, 5, 7, 9, 3, 5, 7, 7, 9, 7, 5, 7, 9, 9, 11, 7, 11, 7, 9, 9, 11, 9, 3, 5, 7, 9, 7, 5, 5, 7, 9, 7, 7, 9, 9, 7, 9, 11, 13, 9, 11, 11, 13, 7, 7, 9, 9, 5, 9, 11, 9, 7, 9
OFFSET
1,1
COMMENTS
a(n) is the rank of prime(n) in the base-5 dominance order on the natural numbers.
LINKS
Tyler Ball and Daniel Juda, Dominance over N, Rose-Hulman Undergraduate Mathematics Journal, Vol. 13, No. 2, Fall 2013.
FORMULA
a(n) = A053824(A000040(n)).
EXAMPLE
The fifth prime is 11, 11 in base 5 is (2,1) so a(5)=2+1=3.
MATHEMATICA
Table[Plus @@ IntegerDigits[Prime[n], 5], {n, 1, 100}] (* Vincenzo Librandi, Mar 25 2014 *)
PROG
(Sage) [sum(i.digits(base=5)) for i in primes_first_n(200)]
(Magma) [&+Intseq(NthPrime(n), 5): n in [1..100]]; // Vincenzo Librandi, Mar 25 2014
(PARI) a(n) = sumdigits(prime(n), 5); \\ Michel Marcus, Mar 04 2023
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Tom Edgar, Mar 24 2014
STATUS
approved