A191153 a(n) = floor(2*n*Pi) - 2*floor(n*Pi).

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, 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, 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

Offset

1

Comments

Equivalently, the nearest integer to the fractional part of n*Pi. - Rick L. Shepherd, Aug 24 2020

Links

Rick L. Shepherd, Table of n, a(n) for n = 1..10000

Formula

a(n) = A038130(n) - 2*A022844(n). - Michel Marcus, Aug 24 2020

Maple

A191153:=n->floor(2*n*Pi) - 2*floor(n*Pi): seq(A191153(n), n=1..100); # Wesley Ivan Hurt, Jul 03 2014

Mathematica

f[n_] := Floor[2 n*Pi] - 2*Floor[n*Pi];
t = Table[f[n], {n, 1, 220}]  (* A191153 *)
Flatten[Position[t, 0]]    (* A191159 *)
Flatten[Position[t, 1]]    (* A191164 *)

Prog

(PARI) a(n) = round(frac(n*Pi)) \\ Rick L. Shepherd, Aug 24 2020

Crossrefs

Cf. A038130, A022844, A191159, A191164.

Sequence in context: A118953 A023970 A072626 * A011659 A136036 A214210

Adjacent sequences: A191150 A191151 A191152 * A191154 A191155 A191156

Keyword

nonn,easy

Author

Clark Kimberling, May 27 2011

Status

approved