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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A190775 [(bn+c)r]-b[nr]-[cr], where (r,b,c)=(sqrt(1/2),3,2) and [ ]=floor. 5
 2, 1, 0, 2, 2, 1, 3, 2, 1, 0, 2, 1, 0, 3, 2, 1, 0, 2, 1, 0, 2, 2, 1, 3, 2, 1, 0, 2, 1, 1, 3, 2, 1, 0, 2, 1, 0, 3, 2, 1, 3, 2, 1, 0, 2, 1, 1, 3, 2, 1, 0, 2, 1, 0, 3, 2, 1, 0, 2, 1, 0, 2, 2, 1, 3, 2, 1, 0, 2, 1, 1, 3, 2, 1, 0, 2, 1, 0, 2, 2, 1, 3, 2, 1, 0, 2, 1, 1, 3, 2, 1, 0, 2, 1, 0, 3, 2, 1, 0, 2, 1, 0, 2, 2, 1, 3, 2, 1, 0, 2, 1, 1, 3, 2, 1, 0, 2, 1, 0, 2, 2, 1, 3, 2, 1, 0, 2, 1, 1, 3, 2, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Write 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. Examples: (golden ratio,2,1):  A190427-A190430 (sqrt(2),2,0):  A190480-A190482 (sqrt(2),2,1):  A190483-A190486 (sqrt(2),3,0):  A190487-A190490 (sqrt(2),3,1):  A190491-A190495 (sqrt(2),3,2):  A190496-A190500 (sqrt(2),4,c):  A190544-A190566 LINKS MATHEMATICA r = Sqrt[1/2]; b = 3; c = 2; f[n_] := Floor[(b*n + c)*r] - b*Floor[n*r] - Floor[c*r]; t = Table[f[n], {n, 1, 200}] (* A190775 *) Flatten[Position[t, 0]]      (* A190776 *) Flatten[Position[t, 1]]      (* A190777 *) Flatten[Position[t, 2]]      (* A190778 *) Flatten[Position[t, 3]]      (* A190779 *) CROSSREFS Cf. A190776-A190779. Sequence in context: A035152 A035204 A326987 * A282459 A016154 A307332 Adjacent sequences:  A190772 A190773 A190774 * A190776 A190777 A190778 KEYWORD nonn AUTHOR Clark Kimberling, May 19 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.

Last modified September 22 17:39 EDT 2021. Contains 347607 sequences. (Running on oeis4.)