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.

A095396 Modified juggler map: for even numbers: a(n) = floor(n^(2/3)) and for odd n: a(n) = floor(n^(3/2)) = floor(sqrt(n^3)).

Original entry on oeis.org

1, 1, 5, 2, 11, 3, 18, 4, 27, 4, 36, 5, 46, 5, 58, 6, 70, 6, 82, 7, 96, 7, 110, 8, 125, 8, 140, 9, 156, 9, 172, 10, 189, 10, 207, 10, 225, 11, 243, 11, 262, 12, 281, 12, 301, 12, 322, 13, 343, 13, 364, 13, 385, 14, 407, 14, 430, 14, 453, 15, 476, 15, 500, 16, 524, 16, 548, 16
Offset: 1

Views

Author

Labos Elemer, Jun 18 2004

Keywords

Comments

Parallel to A094683: values for odd arguments are same, for even not necessarily so.

Crossrefs

Programs

  • Mathematica
    d[x_]:=d[x]=(1-Mod[x, 2])*Floor[N[x^(2/3), 50]] +Mod[x, 2]*Floor[N[x^(3/2), 50]];d[1]=1; Table[d[w], {w, 1, 150}]
    Table[If[EvenQ[n],Floor[n^(2/3)],Floor[n^(3/2)]],{n,70}] (* Harvey P. Dale, Dec 28 2018 *)
  • Scheme
    (define (A095396 n) (if (even? n) (A048766 (* n n)) (A000196 (* n n n)))) ;; Antti Karttunen, May 28 2017

Formula

For even n: a(n) = A048766(n^2), for odd n: a(n) = A000196(n^3). - Antti Karttunen, May 28 2017

Extensions

Name simplified by Antti Karttunen, May 28 2017