|
%I #15 Mar 13 2018 04:16:35
%S 0,0,0,1,1,2,2,2,2,3,3,4,4,5,4,4,4,5,4,6,5,6,5,6,6,6,6,7,7,7,8,8,8,9,
%T 8,9,8,8,9,9,9,9,9,10,11,10,10,11,11,10,10,12,11,11,11,11,11,11,11,11,
%U 12,12,12,12,11,13,12,12,12,12,12,12,13,13,14,14
%N Number of steps to reach a fixed point (A003418(n)), when starting from partition {n} of n and continuing with the process described in A225642.
%C a(0)=0, as its only partition is an empty partition {}, and by convention lcm()=1, thus it takes no steps to reach from 1 to A003418(0)=1.
%C The records occur at positions 0, 3, 5, 9, 11, 13, 19, 27, 30, 33, 43, 44, 51, 65, 74, 82, ... and they seem to occur in order, i.e., as A001477. Thus the record-positions probably also give the left inverse function for this sequence. It also seems that each integer occurs only finite times in this sequence, so there should be a right inverse function as well.
%F a(n) = A225644(n) - 1.
%o (Scheme) (define (A225643 n) (-1+ (A225644 n)))
%Y Cf. A225644, A225633, A225639, A226055, A226056.
%K nonn
%O 0,6
%A _Antti Karttunen_, May 15 2013
|
