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 A336302 #51 Oct 31 2020 12:57:09
%S A336302 0,0,1,0,1,0,1,1,0,0,1,0,1,0,1,0,4,4,1,0,1,4,4,1,0,4,3,4,1,0,1,4,3,4,
%T A336302 1,0,4,2,2,4,1,0,1,4,2,2,4,1,0,4,1,0,1,4,1,0,1,4,1,0,1,4,1,0,4,0,7,7,
%U A336302 0,4,1,0,1,4,0,7,7,0,4,1,0,4,9,6,5,6,9,4,1,0,1,4,9,6,5,6,9,4,1,0,4,9,5,3,3,5,9,4
%N A336302 a(n) = n^2 mod ceiling(sqrt(n)).
%C A336302 A pattern emerges for certain values where ceiling(sqrt(n)) is the same.
%H A336302 Michel Marcus, <a href="/A336302/b336302.txt">Table of n, a(n) for n = 1..10000</a>
%H A336302 William Marcum, <a href="https://www.desmos.com/calculator/xf3vryiyw4">Desmos graph</a>
%F A336302 a(n) = A000290(n) mod A003059(n). - _Michel Marcus_, Oct 05 2020
%F A336302 a(n^2) = 0. - _Michel Marcus_, Oct 07 2020
%t A336302 Table[Mod[n^2, Ceiling @ Sqrt[n]], {n, 100}] (* _Amiram Eldar_, Oct 05 2020 *)
%o A336302 (PARI) a(n) = lift(Mod(n, ceil(sqrt(n)))^2); \\ _Michel Marcus_, Oct 05 2020
%Y A336302 Cf. A000290, A003059.
%K A336302 nonn,easy,look
%O A336302 1,17
%A A336302 _William Phoenix Marcum_, Oct 05 2020