|
%I #7 Sep 15 2019 20:10:57
%S 0,0,1,0,1,0,1,0,0,1,0,1,0,1,0,0,1,0,1,0,1,0,1,1,0,1,0,1,0,1,1,0,1,0,
%T 1,0,1,0,1,0,0,1,0,1,0,1,0,0,1,0,1,0,1,0,1,1,0,1,0,1,0,1,1,0,1,0,1,0,
%U 1,1,0,1,0,1,0,1,0,1,0,0,1,0,1,0,1,0
%N a(n) = [(2n+2)e] - [(n+2)e] - [ne], where [ ] = floor.
%H Clark Kimberling, <a href="/A327211/b327211.txt">Table of n, a(n) for n = 0..10000</a>
%F [(2n+2)e] - [(n+2)e] - [ne], where [ ] = floor.
%t r = E; z = 200;
%t t = Table[Floor[(2 n + 2)*r] - Floor[n*r + 2 r] - Floor[n*r], {n, 0, z}]
%Y The positions of 0's and 1's in {a(n) : n > 0} are given by A327212 and A327213.
%K nonn,easy
%O 0
%A _Clark Kimberling_, Aug 29 2019
|
