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 A372971 #29 May 20 2024 16:26:04 %S A372971 1,2,3,2,2,3,2,4,4,5,5,4,4,7,7,4,4,4,4,5,4,5,4,6,6,6,6,4,7,4,7,8,8,8, %T A372971 8,9,9,9,9,8,8,10,10,8,9,11,11,8,8,8,8,8,8,9,9,14,14,8,8,15,15,8,9,8, %U A372971 8,8,8,8,8,8,8,9,8,9,8,9,8,9,8,10 %N A372971 a(1)=1, then a(n) = floor(n/min(a(n-1),a(floor(n/2)))). %C A372971 It seems that limsup and liminf of a(n)/sqrt(n) exist (see link). %H A372971 Hugo Pfoertner, <a href="/A372971/b372971.txt">Table of n, a(n) for n = 1..10000</a> %H A372971 Benoit Cloitre, <a href="/A372971/a372971.png">Plot of a(n)/sqrt(n) for n=1 up to 400000</a> %H A372971 Hugo Pfoertner, <a href="/A372971/a372971.pdf">Plot of a(n)/sqrt(n)</a>, n=1..400000, zoom into pdf to see details. %t A372971 a[1]=1; a[n_]:=Floor[n/Min[a[n-1],a[Floor[n/2]]]]; Array[a,80] (* _Stefano Spezia_, May 18 2024 *) %o A372971 (PARI) a(n)=if(n<2,1,floor(n/min(a(n-1),a(n\2)))) %Y A372971 Cf. A372970, A097051. %K A372971 nonn,look %O A372971 1,2 %A A372971 _Benoit Cloitre_, May 18 2024