id:A059112 - OEIS Search Results

Search: id:A059112

Displaying 1-1 of 1 results found.

page 1

floor[p(n) - n*ln(n) - n*ln(ln(n)) + n] where p(n) is n-th prime.

+0
2

4, 4, 4, 5, 4, 5, 4, 5, 7, 6, 8, 8, 6, 6, 8, 10, 7, 9, 9, 6, 8, 7, 8, 12, 11, 8, 7, 5, 4, 13, 12, 13, 10, 15, 12, 12, 13, 12, 13, 13, 10, 15, 11, 10, 7, 13, 20, 18, 15, 13, 14, 10, 14, 15, 15, 15, 12, 12, 10, 7, 11, 19, 17, 13, 11, 20, 20, 24, 20, 18, 18, 20, 20, 20, 18, 18, 20, 18 (list; graph; listen)

	OFFSET	`2,1`
	LINKS	`C. K. Caldwell, How Many Primes Are There?`
	EXAMPLE	`a(10000) = floor[104729 - 92103.403 - 22203.268 + 10000] = floor[422.328] = 422`
	CROSSREFS	`Cf. A000040, A059111.` `Sequence in context: A100777 A024727 A024552 this_sequence A111731 A134992 A073260` `Adjacent sequences: A059109 A059110 A059111 this_sequence A059113 A059114 A059115`
	KEYWORD	`nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Jan 04 2001`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research