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 A096320 #13 Oct 19 2017 03:14:34
%S A096320 2,3,5,8,2,7,3,0,8,7,7,8,0,3,7,2,8,5,3,2,2,3,5,8,2,7,3,0,8,7,7,8,0,3,
%T A096320 7,2,8,5,3,2,2,3,5,8,2,7,3,0,8,7,7,8,0,3,7,2,8,5,3,2,2,3,5,8,2,7,3,0,
%U A096320 8,7,7,8,0,3,7,2,8,5,3,2,2,3,5,8,2,7,3,0,8,7,7,8,0,3,7,2,8,5,3,2,2,3,5,8,2
%N A096320 a(n) = (n^2+n+4)/2, modulo 10.
%C A096320 This periodic sequence equals A008954(n)+2 modulo 10 and also A061501(n+1)+1 modulo 10.
%H A096320 <a href="/index/Rec#order_15">Index entries for linear recurrences with constant coefficients</a>, signature (0, 0, 0, 0, 1, 0, 0, 0, 0, -1, 0, 0, 0, 0, 1).
%F A096320 a(0)=2, a(1)=3, a(2)=5, a(3)=8, a(4)=2, a(5)=7, a(6)=3, a(7)=0, a(8)=8, a(9)=7, a(10)=7, a(11)=8, a(12)=0, a(13)=3, a(14)=7, a(n)=a(n-5)-a(n-10)+ a(n-15). - _Harvey P. Dale_, Nov 16 2012
%t A096320 Table[Mod[(n^2+n+4)/2,10],{n,0,110}] (* or *) LinearRecurrence[ {0,0,0,0,1,0,0,0,0,-1,0,0,0,0,1},{2,3,5,8,2,7,3,0,8,7,7,8,0,3,7},110] (* _Harvey P. Dale_, Nov 16 2012 *)
%Y A096320 Cf. A008954, A061501.
%K A096320 nonn,easy,less
%O A096320 0,1
%A A096320 _Cino Hilliard_, Aug 02 2004
%E A096320 Edited by _Don Reble_, Apr 16 2007