login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A216877 Number of ordered integers (x,y) satisfying x^(2/3) + y^(2/3) <= n^(2/3). 0

%I #7 Sep 18 2012 21:15:28

%S 1,5,9,17,21,33,49,61,81,105,125,145,169,205,233,273,309,357,393,437,

%T 485,529,565,629,681,741,805,873,933,997,1073,1133,1205,1289,1377,

%U 1453,1537,1633,1725,1793,1889,1989,2081,2177,2293,2393,2497,2621,2721,2833

%N Number of ordered integers (x,y) satisfying x^(2/3) + y^(2/3) <= n^(2/3).

%C Lattice points in x^(2/3) + y^(2/3) <= n^(2/3).

%p count := proc(n)

%p local t, x, y;

%p t := 0;

%p for x from 1 to n-1 do

%p for y from 1 to n-x do

%p if evalf(x^(2/3)+y^(2/3)-n^(2/3)) <= 0 then

%p t := t+1

%p end if:

%p end do:

%p end do;

%p return 4*t+4*n+1:

%p end proc;

%p S := [seq(count(a), a = 0 .. 41)];

%t Table[cnt = 0; Do[If[x^(2/3) + y^(2/3) <= n^(2/3), cnt++], {x, n}, {y, n}]; 4*cnt + 4*n + 1, {n, 0, 50}] (* _T. D. Noe_, Sep 18 2012 *)

%K nonn

%O 0,2

%A _César Eliud Lozada_, Sep 18 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 15:34 EDT 2024. Contains 371794 sequences. (Running on oeis4.)