A225654 a(n) = the number of surplus elements on the n-th row of A225632 compared to the n-th row of A225642.

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.

Links

Table of n, a(n) for n=0..87.

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).

Cf. A225632, A225642, A225630, A225640, A225634, A225644, A225630, A225640.

Sequence in context: A005090 A073490 A279907 * A236747 A194285 A367623

Adjacent sequences: A225651 A225652 A225653 * A225655 A225656 A225657

Keyword

nonn

Author

Antti Karttunen, May 17 2013

Status

approved