A089680 - OEIS

This site is supported by donations to The OEIS Foundation.

A089680

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

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

	OFFSET	`1,1`
	COMMENTS	`Exponential version of log like weighted average function of primes and the prime distribution.`
	MATHEMATICA	`digits=200 g[n_]=(Prime[n]-n)/(n-PrimePi[n]) b=Table[Floor[Exp[((g[n]+g[n+1])-g[n*(n+1)]+1)/1.5]], {n, 1, digits}]`
	CROSSREFS	`Sequence in context: A096836 A096995 A010264 * A160326 A180938 A123561` `Adjacent sequences: A089677 A089678 A089679 * A089681 A089682 A089683`
	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 15 23:34 EST 2012. Contains 205860 sequences.