The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A002821 a(n) = nearest integer to n^(3/2). (Formerly M2437 N0964) 5
 0, 1, 3, 5, 8, 11, 15, 19, 23, 27, 32, 36, 42, 47, 52, 58, 64, 70, 76, 83, 89, 96, 103, 110, 118, 125, 133, 140, 148, 156, 164, 173, 181, 190, 198, 207, 216, 225, 234, 244, 253, 263, 272, 282, 292, 302, 312, 322, 333, 343, 354, 364, 375, 386, 397 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 REFERENCES M. Boll, Tables NumÃ©riques Universelles. Dunod, Paris, 1947, p. 46. 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. A. V. Lebedev and R. M. Fedorova, A Guide to Mathematical Tables. Pergamon, Oxford, 1960, p. 17. 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). LINKS T. D. Noe, Table of n, a(n) for n = 0..1000 FORMULA a(n) = floor(n^(3/2) + 1/2). - Ridouane Oudra, Nov 13 2019 MAPLE [ seq(round(eval(n^(3/2))), n=0..100) ]; MATHEMATICA t[n_]:=Module[{flt=Floor[n], cet=Ceiling[n]}, If[n-flt

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

Last modified May 18 22:46 EDT 2021. Contains 344006 sequences. (Running on oeis4.)