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 A276865 #7 Sep 24 2016 10:40:44
%S A276865 3,4,4,3,4,4,4,3,4,4,4,3,4,4,3,4,4,4,3,4,4,4,3,4,4,4,3,4,4,3,4,4,4,3,
%T A276865 4,4,4,3,4,4,4,3,4,4,3,4,4,4,3,4,4,4,3,4,4,3,4,4,4,3,4,4,4,3,4,4,4,3,
%U A276865 4,4,3,4,4,4,3,4,4,4,3,4,4,4,3,4,4,3
%N A276865 First differences of the Beatty sequence A003512 for 2 + sqrt(3).
%H A276865 Clark Kimberling, <a href="/A276865/b276865.txt">Table of n, a(n) for n = 1..10000</a>
%F A276865 a(n) = floor(n*r) - floor(n*r - r), where r = 2 + sqrt(3), n >= 1.
%t A276865 z = 500; r = 2+Sqrt[3]; b = Table[Floor[k*r], {k, 0, z}] (* A003512 *)
%t A276865 Differences[b] (* A276865 *)
%Y A276865 Cf. A003512, A276883.
%K A276865 nonn,easy
%O A276865 1,1
%A A276865 _Clark Kimberling_, Sep 24 2016