login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
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 A135341

Adjacent sequences:  A225651 A225652 A225653 * A225655 A225656 A225657

KEYWORD

nonn

AUTHOR

Antti Karttunen, May 17 2013

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 21 22:40 EST 2019. Contains 329383 sequences. (Running on oeis4.)