login
A225654
a(n) = the number of surplus elements on the n-th row of A225632 compared to the n-th row of A225642.
8
0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 2, 2, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 2, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1
OFFSET
0,19
COMMENTS
a(n) = how many more iterations is required to reach fixed point A003418(n) with the process described in A225632 and A225642 when starting from partition {1+1+...+1} of n, than when starting from partition {n} of n.
a(0)=0 by convention.
FORMULA
a(n) = A225634(n) - A225644(n).
a(n) = A225638(n) - A225639(n).
PROG
(Scheme): (define (A225654 n) (- (A225634 n) (A225644 n)))
CROSSREFS
Cf. A225653 (positions of zeros).
Sequence in context: A005090 A073490 A279907 * A236747 A194285 A367623
KEYWORD
nonn
AUTHOR
Antti Karttunen, May 17 2013
STATUS
approved