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!)
A190843 [2ne]-2[ne], where [ ]=floor. 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)=[(bn+c)r]-b[nr]-[cr].  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

Table of n, a(n) for n=1..132.

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

Cf. A190847, A190860.

Sequence in context: A323096 A120527 A188093 * A287772 A190198 A071004

Adjacent sequences:  A190840 A190841 A190842 * A190844 A190845 A190846

KEYWORD

nonn

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 26 18:30 EDT 2021. Contains 348268 sequences. (Running on oeis4.)