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 A276861 #9 Sep 26 2016 21:38:11
%S A276861 6,6,6,7,6,6,6,7,6,6,7,6,6,6,7,6,6,7,6,6,6,7,6,6,7,6,6,6,7,6,6,7,6,6,
%T A276861 6,7,6,6,7,6,6,6,7,6,6,7,6,6,6,7,6,6,7,6,6,6,7,6,6,6,7,6,6,7,6,6,6,7,
%U A276861 6,6,7,6,6,6,7,6,6,7,6,6,6,7,6,6,7,6
%N A276861 First differences of the Beatty sequence A038130 for 2*Pi.
%H A276861 Clark Kimberling, <a href="/A276861/b276861.txt">Table of n, a(n) for n = 1..10000</a>
%F A276861 a(n) = floor(n*r) - floor(n*r - r), where r = 2*Pi, n >= 1.
%t A276861 z = 500; r = 2*Pi; b = Table[Floor[k*r], {k, 0, z}]; (* A038130 *)
%t A276861 Differences[b] (* A276861 *)
%Y A276861 Cf. A038130, A276878.
%K A276861 nonn,easy
%O A276861 1,1
%A A276861 _Clark Kimberling_, Sep 24 2016