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 A096319 #18 Mar 09 2025 12:25:53
%S A096319 0,2,5,0,7,8,1,8,7,0,9,0,7,8,1,8,1,0,1,8,9,2,1,4,3,0,1,4,1,0,3,0,1,8,
%T A096319 7,6,7,4,7,4,7,6,7,8,1,8,7,8,1,8,7,0,9,0,1,8,1,0,1,8,9,2,5,2,3,6,3,4,
%U A096319 1,8,7,0,9,6,9,8,1,0,7,8,7,6,7,8,1,0,3,2,9,0,3,0,9,6,7,6,9,8,9,2,3,0,7,0,9,0
%N A096319 Final digit of the sum of the first n primes.
%C A096319 Previous name: "Given the number wheel 0,1,2,3,4,5,6,7,8,9 then starting with 0, the next number is a prime p number of positions from the previous number found, for p=2,3,...".
%C A096319 Conjecture: This sequence carried to infinity is non-repeating and non-terminating. If we concatenate the numbers and introduce a decimal point somewhere, we will get an irrational number.
%F A096319 a(n) = (a(n-1) + prime(n)) mod 10, with a(0) = 0.
%F A096319 a(n) = A007504(n) mod 10. - _Michel Marcus_, Mar 09 2025
%e A096319 Imagine a number wheel 0,1,2,3,4,5,6,7,8,9 like the numbers on an odometer. The first number in the wheel is 0. Counting from 0, the next number is 2 positions beyond 0 which is 2; counting 3 positions from 2, we get 5; counting 5 positions from 5 (when we hit 9, we go to 0) we get 0. 2,5,0 are the first 3 terms in the table.
%t A096319 Mod[Accumulate[Join[{0}, Prime[Range[105]]]], 10] (* _Amiram Eldar_, Mar 09 2025 *)
%o A096319 (PARI) \\ number max of p,m = starting position.
%o A096319 wheel(n,m) = { x=m; forprime(p=2,n, x=(x + p)%10; print1(x",") ) }
%o A096319 (PARI) a(n) = lift(vecsum(apply(x->Mod(x,10), primes(n)))); \\ _Michel Marcus_, Mar 09 2025
%Y A096319 Cf. A096316, A096320.
%Y A096319 Cf. A010879, A007504.
%K A096319 easy,nonn,base
%O A096319 0,2
%A A096319 _Cino Hilliard_, Aug 02 2004
%E A096319 a(0) = 0 inserted and new name by _Michel Marcus_, Mar 09 2025