This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A120246 #16 Dec 19 2024 11:46:19 %S A120246 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 A120246 10,11,12,11,12,9,10,11,11,12,13,12,13,14,10,11,12,12,13,14,13,14,15, %U A120246 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 A120246 a(1) = 1. a(m(m+1)/2 + k) = m + a(k), 1 <= k <= m+1, m >= 1. %C A120246 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 A120246 Kevin Ryde, <a href="/A120246/b120246.txt">Table of n, a(n) for n = 1..10011</a> %H A120246 Kevin Ryde, <a href="/A120244/a120244.gp.txt">PARI/GP Code</a> %o A120246 (PARI) \\ See links. %Y A120246 Cf. A120244, A120245, A057945. %K A120246 easy,nonn %O A120246 1,2 %A A120246 _Leroy Quet_, Jun 12 2006 %E A120246 Extended by _Ray Chandler_, Jun 19 2006