A327174 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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”).

Other ways to Give

A327174

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

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

(list; graph; refs; listen; history; text; internal format)

OFFSET

LINKS

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

FORMULA

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

MATHEMATICA

r = (1 + Sqrt[5])/2; z = 200;

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

CROSSREFS

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

Sequence in context: A021913 A285501 A288551 * A269723 A284487 A156660

Adjacent sequences: A327171 A327172 A327173 * A327175 A327176 A327177

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling, Aug 25 2019

STATUS

approved