|
%I #13 Sep 15 2019 13:56:28
%S 0,1,0,1,1,1,0,0,1,0,0,0,1,0,1,1,1,0,1,1,1,0,0,1,0,0,0,1,0,1,1,1,0,1,
%T 1,0,0,0,1,0,0,0,1,0,1,1,1,0,1,1,0,0,0,1,0,1,1,1,0,1,1,1,0,0,1,0,0,0,
%U 1,0,1,1,1,0,1,1,1,0,0,1,0,0,0,1,0,1
%N a(n) = [(2n+1)r] - [(n+1)r] - [nr], where [ ] = floor and r = sqrt(3).
%H Clark Kimberling, <a href="/A327180/b327180.txt">Table of n, a(n) for n = 0..10000</a>
%F a(n) = [(2n+1)r] - [(n+1)r] - [nr], where [ ] = floor and r = sqrt(3).
%t r = Sqrt[3]; z = 200;
%t t = Table[Floor[(2 n + 1)*r] - Floor[n*r + r] - Floor[n*r], {n, 0, z}]
%Y The positions of 0's and 1's in {a(n) : n > 0} are given by A327181 and A327182.
%K nonn,easy
%O 0
%A _Clark Kimberling_, Aug 25 2019
|
