id:A089679 - OEIS Search Results

Search: id:A089679

Displaying 1-1 of 1 results found.

page 1

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

+0
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; listen)

	OFFSET	`1,1`
	COMMENT	`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 this_sequence A026605 A073783 A130658` `Adjacent sequences: A089676 A089677 A089678 this_sequence A089680 A089681 A089682`
	KEYWORD	`nonn`
	AUTHOR	`Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Jan 04 2004`

page 1

Search completed in 0.002 seconds

Last modified December 15 00:47 EST 2009. Contains 170825 sequences.

AT&T Labs Research