login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A327216
a(n) = [(2n+3)r] - [(n+3)r] - [nr], where [ ] = floor and r = (1+sqrt(5))/2.
3
0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0
OFFSET
0
LINKS
MATHEMATICA
r = (1+Sqrt[5])/2; z = 200;
t = Table[Floor[(2 n + 3) r] - Floor[(n*r + 3 r)] - Floor[n*r], {n, 0, z}] (* fixed by Jianing Song, Sep 30 2019 *)
CROSSREFS
The positions of 0's and 1's in {a(n) : n > 0} are given by A327217 and A327218.
Sequence in context: A189031 A189212 A147781 * A288640 A361115 A082446
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Sep 02 2019
STATUS
approved