|
%I #15 Dec 29 2023 12:09:14
%S 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,
%T 10,11,12,11,12,9,10,11,11,12,13,12,13,14,10,11,12,12,13,14,13,14,15,
%U 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
%N a(1) = 1. a(m(m+1)/2 + k) = m + a(k), 1 <= k <= m+1, m >= 1.
%C When calculating a(n) using the recurrence, the number of steps to reach a(1) is A057945(n-1). - _Kevin Ryde_, Aug 23 2022
%H Kevin Ryde, <a href="/A120246/b120246.txt">Table of n, a(n) for n = 1..10011</a>
%H Kevin Ryde, <a href="/A120244/a120244.gp.txt">PARI/GP Code</a>
%o (PARI) See links.
%Y Cf. A120244, A120245, A057945.
%K easy,nonn
%O 1,2
%A _Leroy Quet_, Jun 12 2006
%E Extended by _Ray Chandler_, Jun 19 2006
|
