cp's OEIS Frontend

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.

Showing 1-1 of 1 results.

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

Original entry on oeis.org

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, 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, 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
Offset: 1

Views

Author

Benoit Cloitre, May 18 2024

Keywords

Comments

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

Crossrefs

Programs

  • PARI
    a(n)=if(n<2,1,floor(n/max(a(n-1),a(n\2))))
Showing 1-1 of 1 results.