login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A095875 Number of lattice points on graph of parabola y >= x^2 with y <= n. 1
0, 1, 4, 7, 10, 15, 20, 25, 30, 35, 42, 49, 56, 63, 70, 77, 84, 93, 102, 111, 120, 129, 138, 147, 156, 165, 176, 187, 198, 209, 220, 231, 242, 253, 264, 275, 286, 299, 312, 325, 338, 351, 364, 377, 390, 403, 416, 429, 442, 455, 470, 485, 500, 515, 530, 545, 560 (list; graph; refs; listen; history; internal format)
OFFSET

-1,3

COMMENTS

Positive terms are partial sums of A001650, n appears n times (n odd).

a(n) is typically larger than the analytical integral (4/3)n^(3/2) of the area because integer points right on the contour contribute with too much statistical weight in the Monte Carlo sense of area estimation. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Nov 06 2006

FORMULA

a(n+1)=a(n)+1+2*floor(sqrt(n+1))=a(n)+A001650(n+2). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Nov 06 2006

EXAMPLE

a(2) = 7 because there are exactly seven points with integer coordinates within the graph of y >= x^2 and bounded by the line y = 2: (0,0), (-1,1), (0,1), (1,1), (-1,2), (0,2) and (1,2).

MAPLE

A095875 := proc(n) local y; sum(1+2*floor(sqrt(y)), y=0..n) ; end: for n from -1 to 60 do printf("%d, ", A095875(n)) ; od ; - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Nov 06 2006

PROG

(PARI) a(n) = sum(k=0, n, 1+2*sqrtint(n)) for(n=-1, 100, print1(a(n), ", "))

CROSSREFS

Cf. A001650 (first differences), A095876 (lattice points of corresponding paraboloid).

Sequence in context: A026372 A014690 A126891 * A071408 A137461 A137379

Adjacent sequences:  A095872 A095873 A095874 * A095876 A095877 A095878

KEYWORD

nonn

AUTHOR

Rick L. Shepherd (rshepherd2(AT)hotmail.com), Jun 10 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 03:59 EST 2012. Contains 205694 sequences.