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 A327310 #12 Sep 15 2019 13:56:56
%S A327310 0,2,1,1,0,0,2,2,1,1,0,0,2,2,1,1,0,0,2,2,1,1,0,0,2,2,1,1,0,0,2,2,1,1,
%T A327310 0,2,2,1,1,0,0,2,2,1,1,0,0,2,2,1,1,0,0,2,2,1,1,0,0,2,2,1,1,0,0,2,2,1,
%U A327310 0,0,2,2,1,1,0,0,2,2,1,1,0,0,2,2,1,1
%N A327310 a(n) = floor(3*n*r) - 3*floor(n*r), where r = sqrt(8).
%H A327310 Clark Kimberling, <a href="/A327310/b327310.txt">Table of n, a(n) for n = 0..10000</a>
%F A327310 a(n) = floor(3*n*r) - 3*floor(n*r), where r = sqrt(8).
%t A327310 r = Sqrt[8]; z = 300;
%t A327310 t = Table[Floor[3 n*r] - 3 Floor[n*r], {n, 0, z}]
%Y A327310 The positions of 0's, 1's and 2's in {a(n) : n > 0} are given by A327311, A327312 and A327313.
%K A327310 nonn,easy
%O A327310 0,2
%A A327310 _Clark Kimberling_, Sep 07 2019