This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A225654 #16 Mar 05 2025 13:43:30
%S A225654 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,
%T A225654 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,
%U A225654 0,0,0,1,0,1,0,0,0,0,0,1,0,1,0,1,0,0,1,1
%N A225654 a(n) = the number of surplus elements on the n-th row of A225632 compared to the n-th row of A225642.
%C A225654 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.
%C A225654 a(0)=0 by convention.
%F A225654 a(n) = A225634(n) - A225644(n).
%F A225654 a(n) = A225638(n) - A225639(n).
%o A225654 (Scheme) (define (A225654 n) (- (A225634 n) (A225644 n)))
%Y A225654 Cf. A225653 (positions of zeros).
%Y A225654 Cf. A225632, A225642, A225630, A225640, A225634, A225644, A225630, A225640.
%K A225654 nonn
%O A225654 0,19
%A A225654 _Antti Karttunen_, May 17 2013