A327211 a(n) = [(2n+2)e] - [(n+2)e] - [ne], where [ ] = floor.

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

Offset

0

Links

Clark Kimberling, Table of n, a(n) for n = 0..10000

Formula

[(2n+2)e] - [(n+2)e] - [ne], where [ ] = floor.

Mathematica

r = E; z = 200;
t = Table[Floor[(2 n + 2)*r] - Floor[n*r + 2 r] - Floor[n*r], {n, 0, z}]

Crossrefs

The positions of 0's and 1's in {a(n) : n > 0} are given by A327212 and A327213.

Sequence in context: A353760 A358770 A022925 * A348327 A144607 A327253

Adjacent sequences: A327208 A327209 A327210 * A327212 A327213 A327214

Keyword

nonn,easy

Author

Clark Kimberling, Aug 29 2019

Status

approved