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.

A077112 a(n)=n^2 times nearest cube to n^2.

Original entry on oeis.org

0, 1, 4, 72, 128, 675, 972, 3136, 4096, 5184, 12500, 15125, 18000, 21125, 42336, 48600, 55296, 99127, 111132, 123823, 137200, 225792, 247808, 270848, 294912, 455625, 492804, 531441, 571536, 613089, 900000, 961000, 1024000, 1089000
Offset: 0

Views

Author

Reinhard Zumkeller, Oct 29 2002

Keywords

Programs

  • Mathematica
    ntnc[n_]:=Module[{n2=n^2,a,b,a3,b3},a=Floor[Power[n2,(3)^-1]]; b=a+1; a3=a^3; b3=b^3;If[n2-a3Harvey P. Dale, Jan 06 2012 *)
    nic[n_]:=Module[{n2=n^2,c},c=Floor[Surd[n2,3]];n2*Nearest[{c^3,(c+1)^3}, n2]]; Join[{0,1},Array[nic,40,2]]//Flatten//Union (* Harvey P. Dale, May 13 2020 *)

Formula

a(n) = A000290(n)*A077110(n).