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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A327256 a(n) = floor(2*n*r) - 2*floor(n*r), where r = sqrt(8). 4
 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0 (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) = floor(2*n*r) - 2*floor(n*r), where r = sqrt(8). MATHEMATICA r = Sqrt[8]; z = 300; t = Table[Floor[2 n r] - 2 Floor[n*r], {n, 0, z}] CROSSREFS The positions of 0's and 1's in {a(n) : n > 0} are given by A327257 and A327258. Sequence in context: A105384 A288694 A292077 * A327177 A057212 A023959 Adjacent sequences: A327253 A327254 A327255 * A327257 A327258 A327259 KEYWORD nonn,easy AUTHOR Clark Kimberling, Sep 03 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 December 3 00:23 EST 2022. Contains 358510 sequences. (Running on oeis4.)