login
A219654
Run lengths in A219652.
7
1, 1, 2, 2, 2, 4, 4, 4, 4, 2, 4, 4, 4, 4, 6, 4, 4, 4, 6, 6, 6, 6, 6, 6, 6, 6, 8, 4, 2, 4, 4, 4, 4, 6, 4, 4, 4, 6, 6, 6, 6, 6, 6, 6, 6, 8, 6, 8, 8, 6, 4, 4, 4, 6, 6, 6, 6, 6, 6, 6, 6, 8, 6, 8, 8, 6, 8, 10, 6, 6, 6, 6, 6, 6, 6, 8, 6, 8, 8, 6, 8, 10, 8, 10, 12, 6
OFFSET
0,3
COMMENTS
a(n) tells from how many starting values one can end to 0 in n steps, with the iterative process described in A219652 (if going around in 0->0 loop is disallowed).
LINKS
FORMULA
a(n) = A219653(n+1)-A219653(n). (The first differences of A219653).
PROG
(Scheme with two different variants):
(define (A219654 n) (- (A219653 (1+ n)) (A219653 n)))
(define (A219654v2 n) (1+ (- (A219655 n) (A219653 n))))
CROSSREFS
a(n) = 1+(A219655(n)-A219653(n)). This sequence is based on Factorial number system: A007623. Analogous sequence for binary system: A086876, for Zeckendorf expansion: A219644. Cf. A219652, A219659, A219666.
Sequence in context: A087627 A195051 A377985 * A096491 A217871 A362872
KEYWORD
nonn
AUTHOR
Antti Karttunen, Nov 25 2012
STATUS
approved