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.

A000092 Let A(n) = #{(i,j,k): i^2 + j^2 + k^2 <= n}, V(n) = (4/3)Pi*n^(3/2), P(n) = A(n) - V(n); sequence gives values of n where |P(n)| sets a new record.

Original entry on oeis.org

1, 2, 5, 6, 14, 21, 29, 30, 54, 90, 134, 155, 174, 230, 234, 251, 270, 342, 374, 461, 494, 550, 666, 750, 810, 990, 1890, 2070, 2486, 2757, 2966, 3150, 3566, 3630, 4554, 4829, 5670, 5750, 8154, 8382, 8774, 8910, 10350, 10710, 15734, 15750, 16302, 17550
Offset: 1

Views

Author

Keywords

Comments

Indices n for which A210641(n) = A117609(n) - A210639(n) yields record values (in absolute value). - M. F. Hasler, Mar 26 2012

References

  • N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Crossrefs

Programs

  • Mathematica
    P[n_] := Sum[SquaresR[3, k], {k, 0, n}] - Round[(4/3)*Pi*n^(3/2)]; record = 0; A000092 = Reap[For[n=1, n <= 2*10^4, n++, If[(p = Abs[P[n]]) > record, record = p; Print[n]; Sow[n]]]][[2, 1]] (* Jean-François Alcover, Feb 04 2016, after M. F. Hasler *)
  • PARI
    m=0; for(n=1,1e4, if(m+0A210641(n)),m),print1(n",")))  /* Start with n=0 to print the initial 0. */ \\ M. F. Hasler, Mar 26 2012

Extensions

Revised Jun 28 2005