id:A096838 - OEIS Search Results

Search: id:A096838

Displaying 1-1 of 1 results found.

page 1

Number of primes in the neighborhood of p[n], the n-th prime in the center with radius Ceiling[Log[p(n)]].

+0
1

2, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 2, 1, 2, 2, 2, 3, 2, 2, 2, 1, 2, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 2, 3, 4, 4, 3, 1, 3, 4, 4, 4, 3, 2, 2, 3, 3, 3, 3, 4, 3, 3, 1, 3, 4, 4, 3, 2, 2, 3, 3, 4, 2, 2, 3, 3, 3, 2, 2, 2, 1, 2, 2, 2, 3, 3, 3, 2, 3, 4, 4, 3, 1, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 3, 3, 3 (list; graph; listen)

	OFFSET	`1,1`
	FORMULA	`a[n] almost equals A096509(p[n])>=a(n) because here only primes are counted, the true prime powers not.`
	EXAMPLE	`n=100: a[100]=2 and the two primes in [534,548] are {541,547};` `for all n, a[n]>=1.`
	CROSSREFS	`Cf. A096509-A096523, A096830-A096840.` `Sequence in context: A078041 A011154 A048466 this_sequence A096007 A059252 A030620` `Adjacent sequences: A096835 A096836 A096837 this_sequence A096839 A096840 A096841`
	KEYWORD	`nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu), Jul 14 2004`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research