OFFSET
1,1
COMMENTS
LINKS
Clark Kimberling, Table of n, a(n) for n = 1..10000
J.-P. Allouche, F. M. Dekking, Generalized Beatty sequences and complementary triples, arXiv:1809.03424v3 [math.NT], 2018-2019.
FORMULA
Conjectured: a(n) = 1 + A214971(n).
Proof of this conjecture: it is easy to see that the infinite Fibonacci word A003849 is a concatenation of the words 01 and 001. So if we replace all 001 by 2, only the 01 remain, i.e., every 0 is directly followed by 1. - Michel Dekking, Aug 19 2018
a(n) = floor((n-1)*phi) + 2*(n-1) + 2 (Theorem 31 in Allouche and Dekking). - Michel Dekking, Oct 08 2018
EXAMPLE
As a word, A284749 = 012012201201220122..., in which 1 is in positions 2,5,9,12,...
MATHEMATICA
s = Nest[Flatten[# /. {0 -> {0, 1}, 1 -> {0}}] &, {0}, 13] (* A003849 *)
w = StringJoin[Map[ToString, s]]
w1 = StringReplace[w, {"001" -> "2"}]
st = ToCharacterCode[w1] - 48 (* A284749 *)
Flatten[Position[st, 0]] (* A214971 conjectured *)
Flatten[Position[st, 1]] (* A284624 *)
Flatten[Position[st, 2]] (* A284625 *)
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, May 02 2017
STATUS
approved