A190451 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A190451

[(bn+c)r]-b[nr]-[cr], where (r,b,c)=(golden ratio,4,2) and []=floor.

2, 1, 3, 2, 0, 3, 1, 4, 2, 0, 3, 1, 0, 2, 1, 3, 2, 0, 3, 1, 4, 2, 1, 3, 2, 0, 2, 1, 3, 2, 0, 3, 1, 0, 2, 1, 3, 2, 0, 3, 1, 4, 2, 1, 3, 1, 0, 2, 1, 3, 2, 0, 3, 1, 4, 2, 1, 3, 2, 0, 3, 1, 3, 2, 0, 3, 1, 0, 2, 1, 3, 2, 0, 3, 1, 4, 2, 1, 3, 2, 0, 2, 1, 3, 2, 0, 3, 1, 0, 2, 1, 3, 2, 0, 3, 1, 4, 2, 0, 3, 1, 0, 2, 1, 3, 2, 0, 3, 1, 4, 2, 1, 3, 2, 0, 3, 1, 3, 2, 0, 3, 1, 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:

(golden ratio,2,0): A078588, A005653, A005652

(golden ratio,2,1): A190427-A190430

(golden ratio,3,0): A140397-A190400

(golden ratio,3,1): A140431-A190435

(golden ratio,3,2): A140436-A190439

LINKS

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

MATHEMATICA

r = GoldenRatio; b = 4; c = 2;

f[n_] := Floor[(b*n + c)*r] - b*Floor[n*r] - Floor[c*r];

t = Table[f[n], {n, 1, 320}]