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!)
A327211 a(n) = [(2n+2)e] - [(n+2)e] - [ne], where [ ] = floor. 3
0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 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

[(2n+2)e] - [(n+2)e] - [ne], where [ ] = floor.

MATHEMATICA

r = E; 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 A327212 and A327213.

Sequence in context: A151763 A324908 A022925 * A144607 A327253 A051840

Adjacent sequences:  A327208 A327209 A327210 * A327212 A327213 A327214

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling, Aug 29 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 25 15:22 EDT 2021. Contains 346290 sequences. (Running on oeis4.)