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.

A380891 If n mod 2 = 0 then a(n) = floor(n^(1/3)) else a(n) = floor(n^(4/3)).

Original entry on oeis.org

0, 1, 1, 4, 1, 8, 1, 13, 2, 18, 2, 24, 2, 30, 2, 36, 2, 43, 2, 50, 2, 57, 2, 65, 2, 73, 2, 81, 3, 89, 3, 97, 3, 105, 3, 114, 3, 123, 3, 132, 3, 141, 3, 150, 3, 160, 3, 169, 3, 179, 3, 189, 3, 199, 3, 209, 3, 219, 3, 229, 3, 240, 3, 250, 4, 261, 4, 272
Offset: 0

Views

Author

Vikram Prasad, Feb 08 2025

Keywords

Crossrefs

Interspersion of A048766 and A129011.

Programs

  • Mathematica
    a[n_]:=If[Mod[n,2]==0,Floor[n^(1/3)],Floor[n^(4/3)]]; (* James C. McMahon, Apr 11 2025 *)
  • Python
    import gmpy2
    def a(n): return int(gmpy2.iroot(n**4 if n&1 else n, 3)[0])