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 A070455 #14 Dec 18 2023 12:51:33
%S A070455 0,1,4,9,16,25,3,16,31,15,1,22,12,4,31,27,25,25,27,31,4,12,22,1,15,31,
%T A070455 16,3,25,16,9,4,1,0,1,4,9,16,25,3,16,31,15,1,22,12,4,31,27,25,25,27,
%U A070455 31,4,12,22,1,15,31,16,3,25,16,9,4,1,0,1,4,9,16,25,3,16,31,15,1,22,12,4
%N A070455 a(n) = n^2 mod 33.
%H A070455 G. C. Greubel, <a href="/A070455/b070455.txt">Table of n, a(n) for n = 0..1000</a>
%H A070455 <a href="/index/Rec#order_33">Index entries for linear recurrences with constant coefficients</a>, signature (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).
%F A070455 a(n) = a(n-33). - _G. C. Greubel_, Mar 24 2016
%t A070455 Table[Mod[n^2,33],{n,0,200}] (* _Vladimir Joseph Stephan Orlovsky_, Apr 27 2011 *)
%o A070455 (PARI) a(n)=n^2%33 \\ _Charles R Greathouse IV_, Apr 06 2016
%Y A070455 Cf. A070450, A070451, A070453.
%K A070455 nonn,easy
%O A070455 0,3
%A A070455 _N. J. A. Sloane_, May 12 2002