Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A096840
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A096840 a[n]=x is the least number so that around x^2 (the center) the number of primes is equal to n. The radius of neighborhood is Ceiling[Log[x^2]. +0
9
1, 6, 3, 2, 14, 36, 117, 1652, 9582, 41361, 908637 (list; graph; listen)
OFFSET

1,2

EXAMPLE

n=9: a[9]=41361, center=1710732321, radius=22, the nine primes in the zone are {1710732299, 1710732307, 1710732311, 1710732313, 1710732319, 1710732323, 1710732329, 1710732337, 1710732343}

MATHEMATICA

f[n_] := (PrimePi[n^2 + Ceiling[ Log[n^2]]] - PrimePi[n^2 - Ceiling[ Log[n^2]] - 1]); t = Table[0, {15}]; Do[a = f[n]; If[a < 15 && t[[a + 1]] == 0, t[[a + 1]] = n], {n, 10^5}] (from Robert G. Wilson v Jul 14 2004)

CROSSREFS

Cf. A096509-A096523, A096830-A096839.

Sequence in context: A076214 A011488 A021162 this_sequence A096685 A085670 A011410

Adjacent sequences: A096837 A096838 A096839 this_sequence A096841 A096842 A096843

KEYWORD

more,nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Jul 14 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 23 17:35 EDT 2008. Contains 142285 sequences.


AT&T Labs Research