A120246 a(1) = 1. a(m(m+1)/2 + k) = m + a(k), 1 <= k <= m+1, m >= 1.

1, 2, 3, 3, 4, 5, 4, 5, 6, 6, 5, 6, 7, 7, 8, 6, 7, 8, 8, 9, 10, 7, 8, 9, 9, 10, 11, 10, 8, 9, 10, 10, 11, 12, 11, 12, 9, 10, 11, 11, 12, 13, 12, 13, 14, 10, 11, 12, 12, 13, 14, 13, 14, 15, 15, 11, 12, 13, 13, 14, 15, 14, 15, 16, 16, 15, 12, 13, 14, 14, 15, 16, 15, 16, 17, 17, 16, 17, 13

Offset

1,2

Comments

When calculating a(n) using the recurrence, the number of steps to reach a(1) is A057945(n-1). - Kevin Ryde, Aug 23 2022

Links

Kevin Ryde, Table of n, a(n) for n = 1..10011

Kevin Ryde, PARI/GP Code

Prog

(PARI) \\ See links.

Crossrefs

Cf. A120244, A120245, A057945.

Sequence in context: A106500 A280315 A120245 * A361261 A120244 A094727

Adjacent sequences: A120243 A120244 A120245 * A120247 A120248 A120249

Keyword

easy,nonn

Author

Leroy Quet, Jun 12 2006

Extensions

Extended by Ray Chandler, Jun 19 2006

Status

approved