A190685 -id:A190685 - cp's OEIS frontend

A190683 [(bn+c)r]-b[nr]-[cr], where (r,b,c)=(sqrt(3),3,1) and [ ]=floor.

2, 2, 1, 3, 2, 1, 1, 3, 2, 1, 0, 3, 2, 1, 3, 2, 2, 1, 3, 2, 1, 1, 3, 2, 1, 0, 3, 2, 1, 3, 2, 2, 1, 3, 2, 1, 0, 3, 2, 1, 0, 2, 2, 1, 3, 2, 1, 1, 3, 2, 1, 0, 3, 2, 1, 3, 2, 2, 1, 3, 2, 1, 1, 3, 2, 1, 0, 3, 2, 1, 3, 2, 2, 1, 3, 2, 1, 1, 3, 2, 1, 0, 3, 2, 1, 3, 2, 1, 1, 3, 2, 1, 0, 3, 2, 1, 0, 2, 2, 1, 3, 2, 1, 1, 3, 2, 1, 0, 3, 2, 1, 3, 2, 2, 1, 3, 2, 1, 1, 3, 2, 1, 0, 3, 2, 1, 3, 2, 2, 1, 3

Offset: 1

Clark Kimberling, May 17 2011

nonn

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 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

Cf. A190684-A190687.

r = Sqrt[3]; b = 3; c = 1;
f[n_] := Floor[(b*n + c)*r] - b*Floor[n*r] - Floor[c*r];
t = Table[f[n], {n, 1, 200}] (* A190683 *)
Flatten[Position[t, 0]]      (* A190684 *)
Flatten[Position[t, 1]]      (* A190685 *)
Flatten[Position[t, 2]]      (* A190686 *)
Flatten[Position[t, 3]]      (* A190687 *)

cp's OEIS Frontend

A190683 [(bn+c)r]-b[nr]-[cr], where (r,b,c)=(sqrt(3),3,1) and [ ]=floor.

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica