|
%I #15 Feb 14 2017 11:10:57
%S 2,3,2,3,3,2,3,2,3,3,2,3,3,2,3,2,3,3,2,3,2,3,3,2,3,3,2,3,2,3,3,2,3,3,
%T 2,3,2,3,3,2,3,2,3,3,2,3,3,2,3,2,3,3,2,3,2,3,3,2,3,3,2,3,2,3,3,2,3,3,
%U 2,3,2,3,3,2,3,2,3,3,2,3,3,2,3,2,3,3
%N Difference sequence of the upper Wythoff sequence, A001950, with 2 prepended.
%C Another version of the infinite Fibonacci word (see Formula). Start with 2, apply 2->23, 3->233, and take the limit.
%H Clark Kimberling, <a href="/A282162/b282162.txt">Table of n, a(n) for n = 0..10000</a>
%F a(n) = 1 + A001468(n).
%t r = GoldenRatio^2; Table[Floor[(n + 1) r] - Floor[n r], {n, 0, 120}]
%Y Cf. A001950, A001468, A076662.
%K nonn,easy
%O 0,1
%A _Clark Kimberling_, Feb 09 2017
|
