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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A327202 a(n) = [(2n+2)r] - [(n+2)r] - [nr], where [ ] = floor and r = (1+sqrt(5))/2. 3
 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 (list; graph; refs; listen; history; text; internal format)
 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 * A083651 A111748 A282244 Adjacent sequences:  A327199 A327200 A327201 * A327203 A327204 A327205 KEYWORD nonn,easy AUTHOR Clark Kimberling, Aug 26 2019 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 16 13:21 EDT 2022. Contains 353704 sequences. (Running on oeis4.)