id:A109578 - OEIS Search Results

Search: id:A109578

Displaying 1-1 of 1 results found.

page 1

[pi(n+1)-pi(n)][prime(n+1)-prime(n)], where pi(k) is the number of prime numbers less than or equal to k and prime(k) is the k-th prime number.

+0
2

1, 2, 0, 4, 0, 4, 0, 0, 0, 2, 0, 4, 0, 0, 0, 6, 0, 6, 0, 0, 0, 4, 0, 0, 0, 0, 0, 2, 0, 14, 0, 0, 0, 0, 0, 6, 0, 0, 0, 6, 0, 10, 0, 0, 0, 12, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 6, 0, 2, 0, 0, 0, 0, 0, 14, 0, 0, 0, 4, 0, 8, 0, 0, 0, 0, 0, 4, 0, 0, 0, 10, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 6, 0, 0, 0, 6, 0, 6, 0, 0 (list; graph; listen)

	OFFSET	`1,2`
	MAPLE	`with(numtheory): a:=n->(pi(n+1)-pi(n))*(ithprime(n+1)-ithprime(n)): seq(a(n), n=1..160);`
	MATHEMATICA	`an = Table[(PrimePi[n + 1] - PrimePi[n])*(Prime[n + 1] - Prime[n]), {n, 1, 200}]`
	CROSSREFS	`Cf. A001223, A010051.` `Adjacent sequences: A109575 A109576 A109577 this_sequence A109579 A109580 A109581` `Sequence in context: A051517 A053118 A119607 this_sequence A082519 A035688 A046769`
	KEYWORD	`nonn`
	AUTHOR	`Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Jun 29 2005`

page 1

Search completed in 0.002 seconds

Last modified October 13 20:18 EDT 2008. Contains 145016 sequences.

AT&T Labs Research