This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A002821 Nearest integer to n^(3/2). (Formerly M2437 N0964) 4

%I M2437 N0964

%S 0,1,3,5,8,11,15,19,23,27,32,36,42,47,52,58,64,70,76,83,89,96,103,110,

%T 118,125,133,140,148,156,164,173,181,190,198,207,216,225,234,244,253,

%U 263,272,282,292,302,312,322,333,343,354,364,375,386,397

%N Nearest integer to n^(3/2).

%D M. Boll, Tables Num\'{e}riques Universelles. Dunod, Paris, 1947, p. 46.

%D M. Hall, Jr., The Diophantine equation x^3-y^2=k, pp. 173-198 of A. O. L. Atkin and B. J. Birch, editors, Computers in Number Theory. Academic Press, NY, 1971.

%D A. V. Lebedev and R. M. Fedorova, A Guide to Mathematical Tables. Pergamon, Oxford, 1960, p. 17.

%D N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

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

%H T. D. Noe, <a href="/A002821/b002821.txt">Table of n, a(n) for n=0..1000</a>

%p [ seq(round(eval(n^(3/2))), n=0..100) ];

%t t[n_]:=Module[{flt=Floor[n],cet=Ceiling[n]},If[n-flt<cet-n,flt, cet]]; t/@(Range[0,60]^((3/2))) (* From Harvey P. Dale, May 12 2011 *)

%K nonn,easy,nice

%O 0,3

%A _N. J. A. Sloane_.

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 .