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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A001618 Nearest integer to 2*n*log(n).
(Formerly M2623 N1038)
1
0, 0, 3, 7, 11, 16, 22, 27, 33, 40, 46, 53, 60, 67, 74, 81, 89, 96, 104, 112, 120, 128, 136, 144, 153, 161, 169, 178, 187, 195, 204, 213, 222, 231, 240, 249, 258, 267, 276, 286, 295, 305, 314, 323, 333, 343, 352, 362, 372, 381, 391, 401, 411, 421, 431, 441 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

REFERENCES

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

Vincenzo Librandi, Table of n, a(n) for n = 0..100000

S. Kullback, M. Kupperman, and H. H. Ku, An application of information theory to the analysis of contingency tables, with a table of 2n ln n, n=1(1)10,000. J. Res. Nat. Bur. Standards Sect. B 66B (1962), pp. 217-243.

MATHEMATICA

Join[{0}, Table[Floor[2*n*Log[n] + 1/2], {n, 60}]] (* T. D. Noe, Aug 09 2012 *)

PROG

(MAGMA) [0], [Round(2*n*Log(n)): n in [1..60]]; // Vincenzo Librandi, Oct 21 2011

(PARI) a(n)=round(2*n*log(n)) \\ Charles R Greathouse IV, Apr 17 2012

CROSSREFS

Sequence in context: A166092 A184913 A022821 * A118027 A082644 A131024

Adjacent sequences:  A001615 A001616 A001617 * A001619 A001620 A001621

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified March 28 11:45 EDT 2017. Contains 284186 sequences.