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 A096316 #10 Oct 01 2013 17:58:01 %S A096316 4,7,2,9,0,3,0,9,2,1,2,9,0,3,0,3,2,3,0,1,4,3,6,5,2,3,6,3,2,5,2,3,0,9, %T A096316 8,9,6,9,6,9,8,9,0,3,0,9,0,3,0,9,2,1,2,3,0,3,2,3,0,1,4,7,4,5,8,5,6,3, %U A096316 0,9,2,1,8,1,0,3,2,9,0,9,8,9,0,3,2,5,4,1,2,5,2,1,8,9,8,1,0,1,4,5,2,9,2,1,2 %N A096316 Given the number wheel 0,1,2,3,4,5,6,7,8,9 then starting with 2, the next number is a prime p number of positions from the previous number found, for p=2,3,... %C A096316 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 A096316 n=2, n = (n mod 10 + p)%10 where p is prime = 2, 3, 5... %e A096316 Imagine a number wheel 0,1,2,3,4,5,6,7,8,9 like the numbers on an odometer. The first prime in the wheel is 2. Counting from 2, the next number is 2 positions beyond 2 which is 4; counting 3 positions from 4, we get 7; counting 5 positions from 7 (when we hit 9, we go to 0) we get 2. 4,7,2 are the first 3 terms in the table. %t A096316 a[-2] = 2; a[n_] := a[n] = Mod[a[n - 1] + Prime[n + 2], 10]; Array[a, 105, -1] (* _Robert G. Wilson v_, Mar 10 2013 *) %o A096316 (PARI) f(n) = x=2;forprime(p=2,n,x=(x%10+p)%10;print1(x",")) %Y A096316 Cf. A096319. %K A096316 easy,nonn %O A096316 0,1 %A A096316 _Cino Hilliard_, Aug 02 2004