|
%I #18 Aug 24 2020 22:51:38
%S 0,0,0,1,1,1,1,0,0,0,1,1,1,1,0,0,0,1,1,1,1,0,0,0,1,1,1,1,0,0,0,1,1,1,
%T 1,0,0,0,1,1,1,1,0,0,0,1,1,1,1,0,0,0,1,1,1,1,0,0,0,0,1,1,1,0,0,0,0,1,
%U 1,1,0,0,0,0,1,1,1,0,0,0,0,1,1,1,0,0,0,0,1,1,1,0,0,0,0,1,1,1,0,0,0,0,1,1,1,0,0,0,0,1,1,1,1,0,0,0,1
%N a(n) = floor(2*n*Pi) - 2*floor(n*Pi).
%C Equivalently, the nearest integer to the fractional part of n*Pi. - _Rick L. Shepherd_, Aug 24 2020
%H Rick L. Shepherd, <a href="/A191153/b191153.txt">Table of n, a(n) for n = 1..10000</a>
%F a(n) = A038130(n) - 2*A022844(n). - _Michel Marcus_, Aug 24 2020
%p A191153:=n->floor(2*n*Pi) - 2*floor(n*Pi): seq(A191153(n), n=1..100); # _Wesley Ivan Hurt_, Jul 03 2014
%t f[n_] := Floor[2 n*Pi] - 2*Floor[n*Pi];
%t t = Table[f[n], {n, 1, 220}] (* A191153 *)
%t Flatten[Position[t, 0]] (* A191159 *)
%t Flatten[Position[t, 1]] (* A191164 *)
%o (PARI) a(n) = round(frac(n*Pi)) \\ _Rick L. Shepherd_, Aug 24 2020
%Y Cf. A038130, A022844, A191159, A191164.
%K nonn,easy
%O 1
%A _Clark Kimberling_, May 27 2011
|
