|
%I #15 Sep 15 2019 20:11:36
%S 0,1,1,0,0,0,1,1,1,0,0,0,1,1,1,0,0,0,1,1,1,0,0,0,1,1,1,0,0,0,1,1,1,0,
%T 0,1,1,1,0,0,0,1,1,1,0,0,0,1,1,1,0,0,0,1,1,1,0,0,0,1,1,1,0,0,0,1,1,1,
%U 0,0,1,1,1,0,0,0,1,1,1,0,0,0,1,1,1,0
%N a(n) = floor(2*n*r) - 2*floor(n*r), where r = sqrt(8).
%H Clark Kimberling, <a href="/A327256/b327256.txt">Table of n, a(n) for n = 0..10000</a>
%F a(n) = floor(2*n*r) - 2*floor(n*r), where r = sqrt(8).
%t r = Sqrt[8]; z = 300;
%t t = Table[Floor[2 n r] - 2 Floor[n*r], {n, 0, z}]
%Y The positions of 0's and 1's in {a(n) : n > 0} are given by A327257 and A327258.
%K nonn,easy
%O 0
%A _Clark Kimberling_, Sep 03 2019
|
