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 A380192 #27 Feb 06 2025 08:23:03 %S A380192 2,3,5,7,2,4,8,0,5,1,4,0,5,7,1,8,4,7,3,8,0,6,1,7,6,2,4,8,0,5,0,5,1,3, %T A380192 4,7,3,0,4,1,7,0,1,3,7,9,4,7,1,3,8,4,7,8,4,1,7,0,6,1,3,4,0,5,7,1,7,3, %U A380192 4,6,1,7,6,3,9,4,0,9,5,3,4,7,8,0,6,1,7,6,1,3,7,0,9 %N A380192 Sum mod(10) of digits of n-th prime. %C A380192 All remainders 0,...,9 occur in this sequence. %H A380192 Paolo Xausa, <a href="/A380192/b380192.txt">Table of n, a(n) for n = 1..10000</a> %H A380192 Enrique Navarrete, <a href="/A380192/a380192_2.pdf">Distributions of Sums of Digits of Primes</a> %F A380192 a(n) = A010879(A007605(n)). %t A380192 Mod[DigitSum[Prime[Range[100]]], 10] (* _Paolo Xausa_, Feb 06 2025 *) %o A380192 (PARI) a(n) = sumdigits(prime(n)) % 10; \\ _Michel Marcus_, Jan 16 2025 %Y A380192 Cf. A007605, A010879, A053837, A158293. %K A380192 nonn,base %O A380192 1,1 %A A380192 _Enrique Navarrete_, Jan 15 2025