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.

A335925 a(n) = a(floor((n-1)/a(n-1))) + 1 with a(1) = 1.

Original entry on oeis.org

1, 2, 2, 2, 3, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 3, 4, 3, 3, 3, 4, 4, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 4, 5, 4, 4, 4, 4, 4, 5, 4, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 4, 5, 5, 5, 5, 5, 4, 5, 4, 5, 4
Offset: 1

Views

Author

Altug Alkan, Jun 30 2020

Keywords

Comments

Least k such that a(k) = n are 1, 2, 5, 16, 65, 326, 1957, ... (Conjecture: This sequence is A000522).

Crossrefs

Programs

  • Mathematica
    a[1] = 1; a[n_] := a[n] = a[Floor[(n - 1)/a[n - 1]]] + 1 ; Array[a, 100] (* Amiram Eldar, Jun 30 2020 *)
  • PARI
    a=vector(10^2); a[1]=1; for(n=2, #a, a[n]=a[(n-1)\a[n-1]]+1); a;
Showing 1-1 of 1 results.