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 A070434 #28 Dec 18 2023 14:00:16
%S A070434 0,1,4,9,5,3,3,5,9,4,1,0,1,4,9,5,3,3,5,9,4,1,0,1,4,9,5,3,3,5,9,4,1,0,
%T A070434 1,4,9,5,3,3,5,9,4,1,0,1,4,9,5,3,3,5,9,4,1,0,1,4,9,5,3,3,5,9,4,1,0,1,
%U A070434 4,9,5,3,3,5,9,4,1,0,1,4,9,5,3,3,5,9,4,1,0,1,4,9,5,3,3,5,9,4,1,0,1
%N A070434 a(n) = n^2 mod 11.
%H A070434 G. C. Greubel, <a href="/A070434/b070434.txt">Table of n, a(n) for n = 0..1000</a>
%H A070434 <a href="/index/Rec#order_11">Index entries for linear recurrences with constant coefficients</a>, signature (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).
%F A070434 From _R. J. Mathar_, Apr 20 2010: (Start)
%F A070434 a(n) = a(n-11).
%F A070434 G.f.: ( -x*(1+x)*(x^8+3*x^7+6*x^6-x^5+4*x^4-x^3+6*x^2+3*x+1) ) / ( (x-1)*(1+x+x^2+x^3+x^4+x^5+x^6+x^7+x^8+x^9+x^10) ). (End)
%F A070434 a(n) = A010880(n^2). - _Michel Marcus_, Mar 24 2016
%t A070434 Table[Mod[n^2,11],{n,0,200}] (* _Vladimir Joseph Stephan Orlovsky_, Apr 21 2011 *)
%o A070434 (PARI) a(n)=n^2%11 \\ _Charles R Greathouse IV_, Apr 06 2016
%Y A070434 Cf. A010880, A070430, A070431, A070432.
%K A070434 nonn,easy
%O A070434 0,3
%A A070434 _N. J. A. Sloane_, May 12 2002