login
A219644
Run lengths in A219642.
5
1, 1, 1, 2, 2, 1, 2, 3, 2, 3, 3, 2, 3, 3, 3, 2, 2, 3, 3, 3, 2, 3, 4, 1, 2, 3, 3, 3, 2, 3, 4, 3, 3, 3, 5, 2, 3, 3, 3, 2, 3, 4, 3, 3, 3, 5, 3, 4, 4, 4, 5, 1, 2, 3, 3, 3, 2, 3, 4, 3, 3, 3, 5, 3, 4, 4, 4, 5, 3, 3, 3, 5, 5, 3, 5, 5, 3, 2, 3, 3, 3, 2, 3, 4, 3, 3, 3
OFFSET
0,4
COMMENTS
a(n) tells from how many starting values one can end to 0 in n steps, with the iterative process described in A219642 (if going around in 0->0 loop is disallowed).
LINKS
FORMULA
a(n) = A219643(n+1)-A219643(n). (The first differences of A219643).
PROG
(Scheme, with two different variants):
(define (A219644 n) (- (A219643 (1+ n)) (A219643 n)))
(define (A219644v2 n) (1+ (- (A219645 n) (A219643 n))))
CROSSREFS
a(n) = 1+(A219645(n)-A219643(n)).
This sequence is based on Fibonacci number system (Zeckendorf expansion): A014417. Analogous sequence for binary system: A086876, for factorial number system: A219654.
Sequence in context: A120481 A369067 A356647 * A193676 A029291 A333529
KEYWORD
nonn
AUTHOR
Antti Karttunen, Nov 24 2012
STATUS
approved