|
%I #12 Feb 19 2018 22:02:42
%S 1,1,2,2,3,3,4,4,4,5,5,5,5,6,6,6,6,7,7,7,7,7,8,8,8,8,8,8,9,9,9,9,9,9,
%T 10,10,10,10,10,10,10,11,11,11,11,11,11,11,11,12,12,12,12,12,12,12,12,
%U 12,13,13,13,13,13,13,13,13,13,14,14,14,14,14,14,14
%N a(n) = the number of times needed to iterate Hofstadter's A030124, starting from A030124(1)=2, that the result were >= n; a(n) = the least k such that A232739(k) >= n.
%C Does the ratio a(n)/A232746(n) converge towards some limit?
%C (Cf. comments in A232739).
%H Antti Karttunen, <a href="/A232753/b232753.txt">Table of n, a(n) for n = 1..2107</a>
%H <a href="/index/Ho#Hofstadter">Index entries for Hofstadter-type sequences</a>
%e A030124(1)=2 (counted as the first iteration)
%e A030124(2)=4 (counted as the second iteration)
%e A030124(4)=6 (counted as the third iteration)
%e Thus a(4)=2 as we reached 4 in two iterations, but a(5) = a(6) = 3, as three iterations of A030124 are needed to reach a number that is larger than or equivalent to 5, or respectively, 6.
%o (Scheme, with _Antti Karttunen_'s IntSeq-library)
%o (define A232753 (LEAST-GTE-I 1 1 A232739))
%Y Used to compute A232740. Cf. also A232739, A232750, A232746.
%K nonn
%O 1,3
%A _Antti Karttunen_, Dec 04 2013
|
