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 A261091 #11 Aug 10 2015 07:32:13 %S A261091 0,1,1,1,2,2,3,5,8,11,17,25,37,56,85,130,199,305,469,723,1118,1733, %T A261091 2693,4193,6539,10211,15962,24974,39103,61262,96030,150608,236338, %U A261091 371101,583118,916978,1443204,2273434,3584522,5656786,8934696,14123156,22340250 %N A261091 a(n) = number of steps required to reach F(n+1)-1 from F(n+2)-1 by repeatedly subtracting from a natural number the number of ones in its Zeckendorf representation. Here F(n) = the n-th Fibonacci number, F(0) = 0, F(1) = 1, F(2) = 1, F(3) = 2, ... %F A261091 a(n) = A219642(A000071(n+2)) - A219642(A000071(n+1)). [By definition.] %F A261091 a(n) = A219642(A000045(n+2)) - A219642(A000045(n+1)). [Equally.] %o A261091 (Scheme) (define (A261091 n) (let ((end (- (A000045 (+ 1 n)) 1))) (let loop ((k (- (A000045 (+ 2 n)) 1)) (s 0)) (if (= k end) s (loop (A219641 k) (+ 1 s)))))) %Y A261091 Cf. A000045, A000071, A219641, A219642. %Y A261091 From a(1) onward the first differences of both A261081 and A261082. %Y A261091 Cf. A261090 (first differences of this sequence). %Y A261091 Cf. also A261102, A261076. %K A261091 nonn %O A261091 0,5 %A A261091 _Antti Karttunen_, Aug 08 2015