A089679 - OEIS

This site is supported by donations to The OEIS Foundation.

A089679

Let g[n_]=Floor[(Prime[n]-n)/(n-PrimePi[n])]. Then a(n) = (g[n]+g[n+1])-g[n*(n+1)]+1.

2, 2, 1, 1, 2, 2, 1, 0, 1, 1, 1, 2, 2, 1, 1, 2, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 0, 0, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 2, 1 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,1`
	COMMENTS	`Log-type weighted average function of primes and the prime distribution.` `This function makes use of the addition property of logs. The resulting function looks like a log square wave with ringing on the leading edge.`
	MATHEMATICA	`digits=200 g[n_]=Floor[(Prime[n]-n)/(n-PrimePi[n])] b=Table[(g[n]+g[n+1])-g[n*(n+1)]+1, {n, 1, digits}]`
	CROSSREFS	`Sequence in context: A016429 A131852 A139352 * A199010 A026605 A073783` `Adjacent sequences: A089676 A089677 A089678 * A089680 A089681 A089682`
	KEYWORD	`nonn`
	AUTHOR	`Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Jan 04 2004`

Content is available under The OEIS End-User License Agreement .

Last modified February 16 01:56 EST 2012. Contains 205860 sequences.