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.

A000099 Let A(n) = #{(i,j): i^2 + j^2 <= n}, V(n) = Pi*n, 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, 10, 20, 24, 26, 41, 53, 130, 149, 205, 234, 287, 340, 410, 425, 480, 586, 840, 850, 986, 1680, 1843, 2260, 2591, 3023, 3024, 3400, 3959, 3960, 5182, 5183, 7920, 9796, 11233, 14883, 15119, 15120, 19593, 21600, 21603, 21604, 22177, 28559, 28560
Offset: 1

Views

Author

Keywords

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
    nmax = 3*10^4; A[n_] := 1 + 4*Floor[Sqrt[n]] + 4*Floor[Sqrt[n/2]]^2 + 8* Sum[Floor[Sqrt[n - j^2]], {j, Floor[Sqrt[n/2]]+1, Floor[Sqrt[n]]}]; V[n_] := Pi*n; P[n_] := A[n] - V[n]; record = 0; A000099 = Reap[For[k = 0; n = 1, n <= nmax, n++, p = Abs[P[n]]; If[p > record, record = p; k++; Sow[n]; Print["a(", k, ") = ", n];]]][[2, 1]] (* Jean-François Alcover, Feb 03 2016 *)

Extensions

Entry revised by N. J. A. Sloane, Jun 26 2005