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 A079632 #11 Aug 18 2018 08:36:27
%S A079632 0,1,2,0,0,1,1,2,0,0,0,1,1,1,2,0,0,0,0,1,1,1,1,2,0,0,0,0,0,1,1,1,1,1,
%T A079632 2,0,0,0,0,0,0,1,1,1,1,1,1,2,0,0,0,0,0,0,0,1,1,1,1,1,1,1,2,0,0,0,0,0,
%U A079632 0,0,0,1,1,1,1,1,1,1,1,2,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,2,0,0,0,0,0,0
%N A079632 a(n) = floor(n/floor(sqrt(n)))-floor(sqrt(n)).
%H A079632 Mike Müller, Svetlana Puzynina, Michaël Rao, <a href="https://arxiv.org/abs/1401.6536">Infinite square-free self-shuffling words</a>, arXiv:1401.6536 [cs.DM], 2014. See Example 10 p. 7.
%F A079632 a(A064801(n))=0; a(A005563(n))=2.
%t A079632 Table[Floor[n/Floor[Sqrt[n]]]-Floor[Sqrt[n]],{n,110}] (* _Harvey P. Dale_, Feb 04 2016 *)
%o A079632 (PARI) a(n)=floor(n/sqrtint(n))-sqrtint(n)
%Y A079632 Cf. A005563, A064801.
%K A079632 nonn
%O A079632 1,3
%A A079632 _Benoit Cloitre_, Jan 30 2003