The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A372971 a(1)=1, then a(n) = floor(n/min(a(n-1),a(floor(n/2)))). 2
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, 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, 8, 8, 8, 8, 8, 8, 8, 9, 8, 9, 8, 9, 8, 9, 8, 10 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
It seems that limsup and liminf of a(n)/sqrt(n) exist (see link).
LINKS
Hugo Pfoertner, Plot of a(n)/sqrt(n), n=1..400000, zoom into pdf to see details.
MATHEMATICA
a[1]=1; a[n_]:=Floor[n/Min[a[n-1], a[Floor[n/2]]]]; Array[a, 80] (* Stefano Spezia, May 18 2024 *)
PROG
(PARI) a(n)=if(n<2, 1, floor(n/min(a(n-1), a(n\2))))
CROSSREFS
Sequence in context: A085239 A242872 A329362 * A241604 A282900 A126014
KEYWORD
nonn,look
AUTHOR
Benoit Cloitre, May 18 2024
STATUS
approved

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 June 16 05:29 EDT 2024. Contains 373423 sequences. (Running on oeis4.)