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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A327183 a(n) = [(2n+1)e] - [(n+1)e] - [ne], where [ ] = floor. 4
0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
0
LINKS
FORMULA
a(n) = [(2n+1)e] - [(n+1)e] - [ne], where [ ] = floor.
MATHEMATICA
r = E; 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 A327184 and A327185.
Sequence in context: A285830 A288741 A341684 * A347870 A188967 A090171
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 19:39 EDT 2024. Contains 371963 sequences. (Running on oeis4.)