1,1

Indices at which blocks (1;0) occur in infinite Fibonacci word; i.e. n such that A005614(n-2) = 0 and A005614(n-1) = 1 - Benoit Cloitre (benoit7848c(AT)orange.fr), Nov 15 2003

A000201 and this sequence may defined as follows . Consider the maps a -> ab, b -> a, starting from a(1) = a; then A000201 gives the indices of a, A001950 gives the indices of b . The sequence of letters in the infinite word begins a, b, a, a, b, a, b, a, a, b, a, ... Setting a = 0, b = 1 gives A003849 (offset 0); setting a = 1, b = 0 gives A005614 (offset 0) . - DELEHAM Philippe (kolotoko(AT)wanadoo.fr), Feb 20 2004

a(n) = n-th integer which is not equal to the floor of any multiple of phi, where phi = (1+sqrt(5))/2 = golden number. - Philippe LALLOUET (philip.lallouet(AT)wanadoo.fr), May 09 2007

a(n) = Min(m: A134409(m) = A006336(n)). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 24 2007

Write A for A000201 and B for the present sequence (the upper Wythoff sequence, complement of A). Then the composite sequences AA, AB, BA, BB, AAA, AAB,...,BBB,... appear in many complementary equations having solution A000201 (or equivalently, the present sequence). Typical complementary equations: AB=A+B (=A003623), BB=A+2B (=A101864), BBB=3A+5B (=A134864). - Clark Kimberling (ck6(AT)evansville.edu), Nov 14 2007

Apart from the initial 0 in A090909, is this the same as that sequence? - Alec Mihailovs (alec(AT)mihailovs.com), Jul 23 2007

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

C. Berge, Graphs and Hypergraphs, North-Holland, 1973; p. 324, Problem 2.

L. Carlitz, R. Scoville and T. Vaughan, Some arithmetic functions related to Fibonacci numbers, Fib. Quart., 11 (1973), 337-386.

I. G. Connell, Some properties of Beatty sequences I, Canad. Math. Bull., 2 (1959), 190-197.

A. S. Fraenkel, How to beat your Wythoff games' opponent on three fronts, Amer. Math. Monthly, 89 (1982), 353-361 (the case a=1).

Clark Kimberling, Complementary Equations, Journal of Integer Sequences, Vol. 10 (2007), Article 07.1.4.

D. J. Newman, Problem 5252, Amer. Math. Monthly, 72 (1965), 1144-1145.

X. Sun, Wythoff's sequence ..., Discr. Math., 300 (2005), 180-195.

J. C. Turner, The alpha and the omega of the Wythoff pairs, Fib. Q., 27 (1989), 76-86.

I. M. Yaglom, Two games with matchsticks, pp. 1-7 of Qvant Selecta: Combinatorics I, Amer Math. Soc., 2001.

C. Kimberling, Complementary equations and Wythoff sequences, preprint, 2007.

T. D. Noe, Table of n, a(n) for n=1..1000

C. Kimberling, A Self-Generating Set and the Golden Mean, J. Integer Sequences, 3 (2000), #00.2.8.

Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.

Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.

Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.

Eric Weisstein's World of Mathematics, Wythoff Array

Index entries for sequences related to Beatty sequences

a(n) = n + floor(2 n phi). In general b(n) = floor(n*phi^m) = Fibonacci(m-1)*n + floor(Fibonacci(m)*n*phi). - Benoit Cloitre, Mar 18, 2003

Append a 0 to the Zeckendorf expansion (cf. A035517) of n-th term of A000201.

a(n) = A003622(n) + 1 . - DELEHAM Philippe (kolotoko(AT)wanadoo.fr), Apr 30 2004

a(n) = A000201(n) + n . - DELEHAM Philippe (kolotoko(AT)wanadoo.fr), May 02 2004

a(n) = n + floor(n*phi) - Philippe LALLOUET (philip.lallouet(AT)wanadoo.fr), May 09 2007

Table[Floor[N[n*(1+Sqrt[5])^2/4]], {n, 1, 75}]

(PARI) a(n)=floor(n*(sqrt(5)+3)/2)

a(n) = greatest k such that s(k) = n, where s = A026242. Complement of A000201.

Cf. A004976, A004919.

A002251 maps between A000201 and A001950, in that A002251(A000201(n)) = A001950(n), A002251(A001950(n)) = A000201(n).

Cf. A026352.

Sequence in context: A026340 A018717 A090909 this_sequence A022841 A047480 A038127

Adjacent sequences: A001947 A001948 A001949 this_sequence A001951 A001952 A001953

nonn,easy,nice

N. J. A. Sloane (njas(AT)research.att.com).

Corrected by Michael Somos, Jun 07 2000.