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 A053794 #26 Jul 02 2025 16:01:59
%S A053794 0,2,6,4,4,6,2,0,0,2,6,4,4,6,2,0,0,2,6,4,4,6,2,0,0,2,6,4,4,6,2,0,0,2,
%T A053794 6,4,4,6,2,0,0,2,6,4,4,6,2,0,0,2,6,4,4,6,2,0,0,2,6,4,4,6,2,0,0,2,6,4,
%U A053794 4,6,2,0,0,2,6,4,4,6,2,0,0,2,6,4,4,6,2,0,0,2,6,4,4,6,2,0,0,2,6,4,4,6,2,0
%N A053794 a(n) = (n^2 + n) modulo 8.
%C A053794 Periodic with period 8.
%H A053794 Antti Karttunen, <a href="/A053794/b053794.txt">Table of n, a(n) for n = 0..8191</a>
%H A053794 <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (1,-1,1,-1,1,-1,1).
%F A053794 From _Wesley Ivan Hurt_, Jun 22 2022: (Start)
%F A053794 a(n) = 2*A105198(n).
%F A053794 a(n) = a(n-1)-a(n-2)+a(n-3)-a(n-4)+a(n-5)-a(n-6)+a(n-7). (End)
%t A053794 PadRight[{}, 105, {0, 2, 6, 4, 4, 6, 2, 0}] (* _Michael De Vlieger_, Jun 22 2022 *)
%o A053794 (PARI) A053794(n)=[0, 2, 6, 4, 4, 6, 2, 0][n%8+1] \\ _M. F. Hasler_, Aug 27 2012
%o A053794 (Scheme) (define (A053794 n) (modulo (+ (* n n) n) 8)) ;; _Antti Karttunen_, Aug 10 2017
%Y A053794 Cf. A053793, A105198.
%K A053794 nonn,easy
%O A053794 0,2
%A A053794 Stuart M. Ellerstein (ellerstein(AT)aol.com), Mar 27 2000
%E A053794 More terms from _James Sellers_, Apr 08 2000
%E A053794 Extended to n=103 by _Antti Karttunen_, Aug 10 2017