This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A380960 #9 May 04 2025 14:37:59 %S A380960 0,2,2,3,5,5,7,7,8,10,10,11,13,13,15,15,16,18,18,20,20,21,23,23,24,26, %T A380960 26,28,28,29,31,31,32,34,34,36,36,37,39,39,41,41,42,44,44,45,47,47,49, %U A380960 49,50,52,52,54,54,55,57,57,58,60,60,62,62,63,65,65,66 %N A380960 Sum of n and the n-th bit of the infinite Fibonacci word. %C A380960 Also the length of the "scrambled part" of the n-th row of the Hurt-Sada array (depicted in A368050). This is the portion of the n-th row whose i-th term differs from i. See Shallit (2025), Theorem 10. %H A380960 J. Shallit, <a href="https://arxiv.org/abs/2501.08823">The Hurt-Sada array and Zeckendorf representations</a>, arXiv:2501.08823 [math.NT], January 15 2025. %F A380960 a(n) = A003849(n) + n. %Y A380960 Cf. A003849, A368050. %K A380960 nonn %O A380960 0,2 %A A380960 _Jeffrey Shallit_, Feb 09 2025