login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A372970 a(1)=1, then a(n) = floor(n/max(a(n-1),a(floor(n/2)))). 2

%I #20 May 19 2024 13:16:58

%S 1,2,1,2,2,3,2,4,2,5,2,4,3,4,3,4,4,4,4,4,4,5,4,6,4,6,4,7,4,7,4,8,4,8,

%T 4,9,4,9,4,10,4,10,4,8,5,9,5,8,6,8,6,8,6,9,6,8,7,8,7,8,7,8,7,8,8,8,8,

%U 8,8,8,8,8,8,9,8,8,8,9,8,8,8,10,8,8,8,10,8,11,8,11,8,10,9,10,9,10,9,10,9,11

%N a(1)=1, then a(n) = floor(n/max(a(n-1),a(floor(n/2)))).

%C It seems that limsup and liminf of a(n)/sqrt(n) exist (see link).

%H Benoit Cloitre, <a href="/A372970/a372970.png">Plot of a(n)/sqrt(n) for n=1 up to 400000</a>.

%H Hugo Pfoertner, <a href="/A372970/a372970.pdf">Plot of a(n)/sqrt(n)</a>, n=1..400000, zoom into pdf to see details.

%o (PARI) a(n)=if(n<2,1,floor(n/max(a(n-1),a(n\2))))

%Y Cf. A372971, A097051.

%K nonn

%O 1,2

%A _Benoit Cloitre_, May 18 2024

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 10 01:34 EDT 2024. Contains 374191 sequences. (Running on oeis4.)