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

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, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 14

Offset

1,3

Comments

Does the ratio a(n)/A232746(n) converge towards some limit?

(Cf. comments in A232739).

Links

Antti Karttunen, Table of n, a(n) for n = 1..2107

Index entries for Hofstadter-type sequences

Example

A030124(1)=2 (counted as the first iteration)
A030124(2)=4 (counted as the second iteration)
A030124(4)=6 (counted as the third iteration)
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.

Prog

(Scheme, with Antti Karttunen's IntSeq-library)
(define A232753 (LEAST-GTE-I 1 1 A232739))

Crossrefs

Used to compute A232740. Cf. also A232739, A232750, A232746.

Sequence in context: A090501 A361385 A126848 * A067085 A321578 A055086

Adjacent sequences: A232750 A232751 A232752 * A232754 A232755 A232756

Keyword

nonn

Author

Antti Karttunen, Dec 04 2013

Status

approved