login

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”).

Index sequence of the reverse block-fractal sequence A003849.
3

%I #18 Dec 21 2020 07:24:31

%S 1,2,1,3,2,1,5,4,3,2,1,8,7,6,5,4,3,2,1,13,12,11,10,9,8,7,6,5,4,3,2,1,

%T 21,20,19,18,17,16,15,14,13,12,11,10,9,8,7,6,5,4,3,2,1,34,33,32,31,30,

%U 29,28,27,26,25,24,23,22,21,20,19,18,17,16,15,14

%N Index sequence of the reverse block-fractal sequence A003849.

%C The sequence is the concatenation of blocks, the n-th of which, for n >=0, consists of the integers from F(n+1) down to F(2) = 1, where F = A000045, the Fibonacci numbers. See A280511 for the definition of reverse block-fractal sequence. The index sequence (a(n)) of a reverse block-fractal sequence (s(n)) is defined (at A280513) by a(n) = least k > 0 such that (s(k), s(k+1), ..., s(k+n)) = (s(n), s(n-1), ..., s(0)).

%C Apparently (up to offset) a duplicate of A246105. - _R. J. Mathar_, Jan 10 2017

%C Let W be the Fibonacci word A003849. Then a(n) is the least k such that the reversal of the first n-block in W occurs in W beginning at the k-th term. Since (a(n)) is unbounded, the reversal of every block in W occurs infinitely many times in W. - _Clark Kimberling_, Dec 19 2020

%H Clark Kimberling, <a href="/A280514/b280514.txt">Table of n, a(n) for n = 1..1000</a>

%e A003849 = (0,1,0,0,1,0,1,0,0,1,0,0,1,...) = (s(1), s(2), ... ).

%e (init. block #1) = (1); reversal (0) first occurs at s(1), so a(1) = 1;

%e (init. block #2) = (0,1); rev. (1,0) first occurs at s(2), so a(2) = 2;

%e (init. block #3) = (0,1,0); rev. (0,1,0) first occurs at s(1), so a(3) = 1;

%e (init. block #4) = (0,1,0,0); rev. (0,0,1,0) first occurs at s(3), so a(4) = 3.

%t r = GoldenRatio; t = Table[Floor[(n + 2) #] - Floor[(n + 1) #], {n, 0, 220}] &[

%t 2 - GoldenRatio] (* A003849 *)

%t u = StringJoin[Map[ToString, t]]

%t breverse[seq_] := Flatten[Last[Reap[NestWhile[# + 1 &, 1, (StringLength[

%t str = StringTake[seq, Min[StringLength[seq], #]]] == # && ! (Sow[StringPosition[seq, StringReverse[str], 1][[1]][[1]]]) === {}) &]]]];

%t breverse[u] (* _Peter J. C. Moses_, Jan 02 2017 *)

%Y Cf. A000045, A003849.

%K nonn,easy

%O 1,2

%A _Clark Kimberling_, Jan 06 2017