A050141 - OEIS

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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A050141

a(n) = 2*floor((n+1)*phi) - 2*floor(n*phi) - 1 where phi = (1 + sqrt(5))/2 is the golden ratio.

3, 1, 3, 3, 1, 3, 1, 3, 3, 1, 3, 3, 1, 3, 1, 3, 3, 1, 3, 1, 3, 3, 1, 3, 3, 1, 3, 1, 3, 3, 1, 3, 3, 1, 3, 1, 3, 3, 1, 3, 1, 3, 3, 1, 3, 3, 1, 3, 1, 3, 3, 1, 3, 1, 3, 3, 1, 3, 3, 1, 3, 1, 3, 3, 1, 3, 3, 1, 3, 1, 3, 3, 1, 3, 1, 3, 3, 1, 3, 3, 1, 3, 1, 3

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

COMMENTS

First differences of A050140.

The substitutions 3->1 and 1->0 carry this sequence onto the infinite Fibonacci word (A005614).

LINKS

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

PROG

(PARI) a(n)=(n+1+sqrtint(5*(n+1)^2))\2*2 - (n+sqrtint(5*n^2))\2*2 - 1 \\ Charles R Greathouse IV, Dec 28 2017

CROSSREFS

Sequence in context: A216637 A358643 A234308 * A274773 A132752 A131241