|
|
A190445
|
|
[(bn+c)r]-b[nr]-[cr], where (r,b,c)=(golden ratio,4,1) and []=floor.
|
|
5
|
|
|
3, 1, 4, 2, 0, 3, 1, 4, 2, 1, 3, 2, 0, 3, 1, 4, 2, 1, 3, 2, 4, 3, 1, 3, 2, 0, 3, 1, 4, 2, 1, 3, 2, 0, 3, 1, 4, 2, 1, 3, 1, 4, 2, 1, 3, 2, 0, 3, 1, 4, 2, 1, 3, 2, 4, 3, 1, 4, 2, 0, 3, 1, 4, 2, 1, 3, 2, 0, 3, 1, 4, 2, 1, 3, 2, 4, 2, 1, 3, 2, 0, 3, 1, 4, 2, 1, 3, 2, 0, 3, 1, 4, 2, 0, 3, 1, 4, 2, 1, 3, 2, 0, 3, 1, 4, 2, 1, 3, 2, 4, 3, 1, 3, 2, 0, 3, 1, 4, 2, 1, 3, 2, 0, 3, 1, 4, 2, 1, 3, 1, 4, 2, 1, 3, 2, 0
(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 position sequences comprise a partition of the positive integers.
Examples:
|
|
LINKS
|
|
|
MATHEMATICA
|
r = GoldenRatio; b = 4; c = 1;
f[n_] := Floor[(b*n + c)*r] - b*Floor[n*r] - Floor[c*r];
t = Table[f[n], {n, 1, 320}]
Flatten[Position[t, 0]]
Flatten[Position[t, 1]]
Flatten[Position[t, 2]]
Flatten[Position[t, 3]]
Flatten[Position[t, 4]]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|