id:A053621 - OEIS Search Results

Search: id:A053621

Displaying 1-1 of 1 results found.

page 1

Nearest integer to n/(log(n)-1).

+0
1

-1, -7, 30, 10, 8, 8, 7, 7, 8, 8, 8, 8, 8, 9, 9, 9, 9, 10, 10, 10, 10, 11, 11, 11, 11, 12, 12, 12, 12, 12, 13, 13, 13, 13, 14, 14, 14, 14, 15, 15, 15, 15, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18, 19, 19, 19, 19, 19, 20, 20, 20, 20, 20, 21, 21, 21, 21, 22, 22, 22 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`n/(log(n)-1) is a better approximation than n/log(n) to pi(n) the number of primes <= n, though worse than the logarithmic integral or the Riemann prime number formula`
	LINKS	`C. K. Caldwell, How Many Primes Are There?`
	CROSSREFS	`Cf. A000720, A047784, A050499.` `Sequence in context: A122119 A157422 A061644 this_sequence A018831 A063128 A063148` `Adjacent sequences: A053618 A053619 A053620 this_sequence A053622 A053623 A053624`
	KEYWORD	`sign`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Mar 21 2000`

page 1

Search completed in 0.002 seconds

Last modified November 23 10:40 EST 2009. Contains 167421 sequences.

AT&T Labs Research