|
%I #12 Sep 15 2019 20:11:44
%S 0,0,0,1,1,2,2,2,0,0,1,1,2,2,2,0,0,1,1,2,2,2,0,0,1,1,2,2,2,0,0,1,1,2,
%T 2,2,0,0,1,1,1,2,2,0,0,1,1,1,2,2,0,0,1,1,1,2,2,0,0,1,1,1,2,2,0,0,1,1,
%U 1,2,2,0,0,1,1,1,2,2,0,0,0,1,1,2,2,0
%N a(n) = floor(3*n*Pi) - 3*floor(n*Pi).
%H Clark Kimberling, <a href="/A327298/b327298.txt">Table of n, a(n) for n = 0..10000</a>
%F a(n) = floor(3*n*Pi) - 3*floor(n*Pi).
%t r = Pi; z = 300;
%t t = Table[Floor[3 n*r] - 3 Floor[n*r], {n, 0, z}]
%Y The positions of 0's, 1's and 2's in {a(n) : n > 0} are given by A327299, A327300 and A327301.
%K nonn,easy
%O 0,6
%A _Clark Kimberling_, Sep 05 2019
|
