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!)
A190843 a(n) = [2*n*e] - 2*[n*e], where [ ] = floor and e is the natural logarithm base. 5
1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1
COMMENTS
Suppose, in general, that a(n) = [(b*n+c)r] - b*[n*r] - [c*r]. If r > 0 and b and c are integers satisfying b >= 2 and 0 <= c <= b-1, then 0 <= a(n) <= b. The positions of 0 in the sequence a are of interest, as are the position sequences for 1, 2, ..., b. These b+1 (or b) position sequences comprise a partition of the positive integers.
LINKS
MATHEMATICA
f[n_] := Floor[2 n*E] - 2*Floor[n*E];
t = Table[f[n], {n, 1, 220}] (* A190843 *)
Flatten[Position[t, 0]] (* A190847 *)
Flatten[Position[t, 1]] (* A190860 *)
CROSSREFS
Sequence in context: A359379 A120527 A188093 * A287772 A190198 A071004
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, May 26 2011
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 25 06:14 EDT 2024. Contains 371964 sequences. (Running on oeis4.)