login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A327180 a(n) = [(2n+1)r] - [(n+1)r] - [nr], where [ ] = floor and r = sqrt(3). 3

%I

%S 0,1,0,1,1,1,0,0,1,0,0,0,1,0,1,1,1,0,1,1,1,0,0,1,0,0,0,1,0,1,1,1,0,1,

%T 1,0,0,0,1,0,0,0,1,0,1,1,1,0,1,1,0,0,0,1,0,1,1,1,0,1,1,1,0,0,1,0,0,0,

%U 1,0,1,1,1,0,1,1,1,0,0,1,0,0,0,1,0,1

%N a(n) = [(2n+1)r] - [(n+1)r] - [nr], where [ ] = floor and r = sqrt(3).

%H Clark Kimberling, <a href="/A327180/b327180.txt">Table of n, a(n) for n = 0..10000</a>

%F a(n) = [(2n+1)r] - [(n+1)r] - [nr], where [ ] = floor and r = sqrt(3).

%t r = Sqrt[3]; z = 200;

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

%Y The positions of 0's and 1's in {a(n) : n > 0} are given by A327181 and A327182.

%K nonn,easy

%O 0

%A _Clark Kimberling_, Aug 25 2019

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 22 18:45 EDT 2021. Contains 348175 sequences. (Running on oeis4.)