A000223 -id:A000223 - cp's OEIS frontend

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.

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

N. J. A. Sloane

nonn

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

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).

Seth A. Troisi, Table of n, a(n) for n = 1..131
W. C. Mitchell, The number of lattice points in a k-dimensional hypersphere, Math. Comp., 20 (1966), 300-310.
Seth A. Troisi, Python program

Cf. A000323, A000036, A000099, A000413, A000223.

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 *)

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

Revised Jun 28 2005

A000036 Let A(n) = #{(i,j): i^2 + j^2 <= n}, V(n) = Pi*n, P(n) = A(n) - V(n); A000099 gives values of n where |P(n)| sets a new record; sequence gives closest integer to P(A000099(n)).

Original entry on oeis.org

2, 3, 5, 6, 6, -6, 7, 8, 10, 13, 13, 13, 14, -17, 17, 17, 18, -19, 20, -22, 23, 27, -29, -29, 29, -31, -32, -35, 36, -37, -40, -43, -46, -48, -50, -53, -55, -57, -60, -60, -61, -63, -66, -66, -68, -71, -74, -77, -79, -82, -85, -88, -89, -92, -95, -96, -97, -97, -100

Offset: 1

N. J. A. Sloane

sign

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).

David W. Wilson, Table of n, a(n) for n = 1..200
W. C. Mitchell, The number of lattice points in a k-dimensional hypersphere, Math. Comp., 20 (1966), 300-310.

Cf. A000092, A000099, A000223, A000323, A000413.

nmax = 6*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; A000036 = Reap[For[k = 0; n = 1, n <= nmax, n++, p = Abs[pn = P[n]]; If[p > record, record = p; k++; Sow[pn // Round]; Print["a(", k, ") = ", pn // Round]]]][[2, 1]] (* Jean-François Alcover, Feb 03 2016 *)

a(n) = round(P(A000099(n))), where P(n) = A057655(n)-pi*n. - David W. Wilson, May 15 2008

Revised by N. J. A. Sloane, Jun 26 2005

More terms from David W. Wilson, May 15 2008

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

N. J. A. Sloane

nonn

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).

David W. Wilson, Table of n, a(n) for n = 1..200
W. C. Mitchell, The number of lattice points in a k-dimensional hypersphere, Math. Comp., 20 (1966), 300-310.

Cf. A000323, A000036, A000092, A000413, A000223.

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 *)

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

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

Original entry on oeis.org

5, 9, 21, 37, 69, 69, 89, 137, 177, 421, 481, 657, 749, 885, 1085, 1305, 1353, 1489, 1861, 2617, 2693, 3125, 5249, 5761, 7129, 8109, 9465, 9465, 10717, 12401, 12401, 16237, 16237, 24833, 30725, 35237, 46701, 47441, 47441, 61493, 67797, 67805, 67805

Offset: 1

N. J. A. Sloane

nonn

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).

David W. Wilson, Table of n, a(n) for n = 1..200
W. C. Mitchell, The number of lattice points in a k-dimensional hypersphere, Math. Comp., 20 (1966), 300-310.

Cf. A000099, A000036, A000092, A000413, A000223.

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[an = A[n]]; Print["a(", k, ") = ", an];]]][[2, 1]] (* Jean-François Alcover, Feb 07 2016*)

Entry revised Jun 28 2005

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

Original entry on oeis.org

1, 7, 19, 57, 81, 251, 437, 691, 739, 1743, 3695, 6619, 8217, 9771, 14771, 15155, 16831, 18805, 26745, 30551, 41755, 46297, 54339, 72359, 86407, 96969, 131059, 344859, 395231, 519963, 607141, 677397, 741509, 893019, 917217, 1288415, 1406811, 1789599, 1827927, 3085785, 3216051, 3444439, 3524869

Offset: 0

N. J. A. Sloane

nonn

The initial value a(0) = 1 corresponds to an initial A000092(0) = 0 which is the index of a record in the sense that the value P(0) = 0 is larger than all preceding values, because there are none. - M. F. Hasler, May 04 2022

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).

W. C. Mitchell, The number of lattice points in a k-dimensional hypersphere, Math. Comp., 20 (1966), 300-310.

Cf. A000323, A000036, A000092, A000099, A000223.

Cf. A117609 (A(n) in name).

P[n_] := (s = Sum[SquaresR[3, k], {k, 0, n}]) - Round[(4/3)*Pi*n^(3/2)]; record = 0; A000092 = Reap[For[n = 0, n <= 10^4, n++, If[(p = Abs[P[n]]) > record, record = p; Print[s]; Sow[s]]]][[2, 1]] (* Jean-François Alcover, Feb 08 2016, after M. F. Hasler in A000092 *)

a(n) = A117609(A000092(n)), considering A000092(0) = 0. - M. F. Hasler, May 04 2022

Revised Jun 28 2005

a(37)-a(42) from Vincenzo Librandi, Aug 21 2016

A210641 A117609(n)-A210639(n): Difference between number of lattice points in the ball x^2+y^2+z^2 <= n and the volume of this ball rounded to the nearest integer.

Original entry on oeis.org

1, 3, 7, 5, -1, 10, 19, 3, -2, 10, 15, 18, 5, 7, 32, 8, -11, 11, 21, 18, 14, 34, 29, -1, -7, -9, 32, 31, -2, 37, 51, 16, -7, 5, 17, 28, 20, 6, 40, 1, -15, 41, 49, 32, 14, 45, 50, 7, -28, -18, 22, 25, 4, 31, 81, 34, 36, 36, 13, 37, -12, 11, 58, 8, -36, 10, 55

Offset: 0

M. F. Hasler, Mar 26 2012

sign

Record values are listed in A000223, and A000092 gives the corresponding indices. Strictly speaking, these are defined using the absolute values, but it appears they always occur at positive elements.

a[n_] := Sum[SquaresR[3, k], {k, 0, n}] - Round[(4/3)*Pi*n^(3/2)]; Table[a[n], {n, 0, 100}] (* Jean-François Alcover, Feb 04 2016 *)

PARI
```
A210641(n)=A117609(n)-A210639(n)
```

cp's OEIS Frontend

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.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Mathematica

PARI

Extensions

A000036 Let A(n) = #{(i,j): i^2 + j^2 <= n}, V(n) = Pi*n, P(n) = A(n) - V(n); A000099 gives values of n where |P(n)| sets a new record; sequence gives closest integer to P(A000099(n)).

Views

Author

Keywords

References

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

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.

Views

Author

Keywords

References

Links

Crossrefs

Programs

Mathematica

Extensions

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

Views

Author

Keywords

References

Links

Crossrefs

Programs

Mathematica

Extensions

A000413 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); A000092 gives values of n where |P(n)| sets a new record; sequence gives A(A000092(n)).

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A210641 A117609(n)-A210639(n): Difference between number of lattice points in the ball x^2+y^2+z^2 <= n and the volume of this ball rounded to the nearest integer.

Views

Author

Keywords

Comments

Programs

Mathematica

PARI

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