A190431 a(n) = [(b*n+c)*r] - b*[n*r] - [c*r], where (r,b,c)=(golden ratio,3,1) and []=floor.

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

Offset

1,1

Comments

Write a(n) = [(b*n+c)*r] - b*[n*r] - [c*r]. 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

G. C. Greubel, Table of n, a(n) for n = 1..10000

Formula

a(n) = floor((3*n+1)*(1+sqrt(5))/2) - 3*floor(n*(1+sqrt(5))/2) - 1. - G. C. Greubel, Apr 06 2018

Mathematica

r = GoldenRatio; b = 3; c = 1;
f[n_] := Floor[(b*n + c)*r] - b*Floor[n*r] - Floor[c*r];
t = Table[f[n], {n, 1, 320}] (* A190431 *)
Flatten[Position[t, 0]] (* A190432 *)
Flatten[Position[t, 1]] (* A190433 *)
Flatten[Position[t, 2]] (* A190434 *)
Flatten[Position[t, 3]] (* A190435 *)

Prog

(PARI) for(n=1, 100, print1(floor((3*n+1)*(1+sqrt(5))/2) - 3*floor(n*(1+sqrt(5))/2) - 1, ", ")) \\ G. C. Greubel, Apr 06 2018
(Magma) [Floor((3*n+1)*(1+Sqrt(5))/2) - 3*Floor(n*(1+Sqrt(5))/2) - 1: n in [1..100]]; // G. C. Greubel, Apr 06 2018

Crossrefs

Cf. A190432, A190433, A190434, A190435.

Sequence in context: A020779 A260721 A275318 * A325178 A333452 A190451

Adjacent sequences: A190428 A190429 A190430 * A190432 A190433 A190434

Keyword

nonn

Author

Clark Kimberling, May 10 2011

Status

approved