A327202 a(n) = [(2n+2)r] - [(n+2)r] - [nr], where [ ] = floor and r = (1+sqrt(5))/2.

0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1

Offset

0

Links

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

Formula

a(n) = [(2n+2)r] - [(n+2)r] - [nr], where [ ] = floor and r = (1+sqrt(5))/2.

Mathematica

r = (1 + Sqrt[5])/2; 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 A327203 and A327204.

Sequence in context: A260455 A189572 A287028 * A357448 A083651 A111748

Adjacent sequences: A327199 A327200 A327201 * A327203 A327204 A327205

Keyword

nonn,easy

Author

Clark Kimberling, Aug 26 2019

Status

approved