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 A070696 #20 Dec 19 2023 13:49:06
%S A070696 0,1,2,3,4,5,6,7,8,9,10,11,12,13,0,1,2,3,4,5,6,7,8,9,10,11,12,13,0,1,
%T A070696 2,3,4,5,6,7,8,9,10,11,12,13,0,1,2,3,4,5,6,7,8,9,10,11,12,13,0,1,2,3,
%U A070696 4,5,6,7,8,9,10,11,12,13,0,1,2,3,4,5,6,7,8,9,10,11,12,13,0,1,2,3,4,5,6,7,8
%N A070696 a(n) = n mod 14.
%C A070696 Same as n^7 mod 14.
%C A070696 More generally, a(n) = n^(7^k) mod 14, for k >= 0. - _Altug Alkan_, Mar 25 2016
%H A070696 <a href="/index/Rec#order_14">Index entries for linear recurrences with constant coefficients</a>, signature (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).
%t A070696 Table[Mod[n, 14], {n, 0, 120}] (* _Michael De Vlieger_, Mar 25 2016 *)
%o A070696 (Sage) [power_mod(n,7,14) for n in range(0, 93)] # _Zerinvary Lajos_, Oct 28 2009
%o A070696 (PARI) a(n) = n % 14; \\ _Joerg Arndt_, Mar 25 2016
%K A070696 nonn,easy
%O A070696 0,3
%A A070696 _N. J. A. Sloane_, May 13 2002