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 A070392 #26 Dec 07 2019 12:18:23
%S A070392 1,6,3,7,9,10,5,8,4,2,1,6,3,7,9,10,5,8,4,2,1,6,3,7,9,10,5,8,4,2,1,6,3,
%T A070392 7,9,10,5,8,4,2,1,6,3,7,9,10,5,8,4,2,1,6,3,7,9,10,5,8,4,2,1,6,3,7,9,
%U A070392 10,5,8,4,2,1,6,3,7,9,10,5,8,4,2,1,6,3,7
%N A070392 a(n) = 6^n mod 11.
%C A070392 Period 10 (Repeat): [1, 6, 3, 7, 9, 10, 5, 8, 4, 2, ...]. The sequence contains every number from 1 to 10 and only those numbers. - _Wesley Ivan Hurt_, May 19 2014
%H A070392 G. C. Greubel, <a href="/A070392/b070392.txt">Table of n, a(n) for n = 0..1000</a>
%H A070392 <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,0,-1,1). - _R. J. Mathar_, Apr 20 2010
%F A070392 From _R. J. Mathar_, Apr 20 2010: (Start)
%F A070392 a(n) = a(n-1) - a(n-5) + a(n-6).
%F A070392 G.f.: ( -1-5*x+3*x^2-4*x^3-2*x^4-2*x^5 )/((x-1)*(1+x)(x^4-x^3+x^2-x+1) ). (End)
%F A070392 a(n) = a(n-10). - _G. C. Greubel_, Mar 18 2016
%p A070392 A070392:=n->(6^n mod 11); seq(A070392(n), n=0..100); # _Wesley Ivan Hurt_, May 19 2014
%t A070392 Table[Mod[6^n, 11], {n, 0, 100}] (* _Wesley Ivan Hurt_, May 19 2014 *)
%t A070392 PowerMod[6, Range[0, 50], 11] (* _G. C. Greubel_, Mar 18 2016 *)
%o A070392 (Sage) [power_mod(6,n,11)for n in range(0,99)] # _Zerinvary Lajos_, Nov 26 2009
%o A070392 (PARI) a(n)=6^n%11 \\ _Charles R Greathouse IV_, Oct 07 2015
%o A070392 (PARI) a(n) = lift(Mod(6, 11)^n); \\ _Altug Alkan_, Mar 18 2016
%K A070392 nonn,easy
%O A070392 0,2
%A A070392 _N. J. A. Sloane_, May 12 2002