login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A069941 Number of primes p such that n! <= p <= n!+n^2. 2
1, 3, 3, 3, 4, 5, 5, 4, 7, 7, 9, 6, 5, 8, 4, 9, 10, 14, 8, 16, 14, 14, 7, 6, 16, 12, 12, 15, 13, 12, 9, 12, 12, 17, 13, 6, 12, 18, 15, 13, 15, 17, 15, 23, 19, 12, 13, 19, 18, 22, 20, 19, 16, 17, 19, 19, 23, 20, 18, 19, 23, 24, 19, 15, 19, 20, 26, 18, 24, 22, 24, 25, 24, 16, 23 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Conjecture : if n>=2 there are at least 3 primes p such that n!<=p<=n!+n^2 (or stronger : for n>1 a(n)>ln(n)). This is stronger than the conjecture described in A037151(n). Because if n!+k is prime, k composite, k=A*B, where A and B must have, each one, at least one prime factor>n (if not : A=q*A' q<=n then n!+k is divisible by q), hence k>n^2. Also stronger (but more restrictive) than the Schinzel conjecture : "for m large enough there's at least one prime p such that m<=p<=m+ln(m)^2" since n^2<ln(n!)^2 for n>5.

For the n-th term we have a(n) = pi(n!+n^2) - pi(n!), where pi(x) is the prime counting function. However, pi(n!) is difficult to compute for n>25. The Prime Number Theorem states that pi(x) and Li(x), the logarithmic integral, are asymptotically equal. Hence we can approximate a(n) by Li(n!+n^2) - Li(n!). These approximate values of a(n) are plotted as the red curve in the "Theoretical versus Actual" plot. By the way, using x/log(x) as approximation for Li(x) would change the curve by at most 1 unit. [From T. D. Noe, Mar 06 2010]

LINKS

T. D. Noe, Table of n, a(n) for n=1..300

T. D. Noe, Theoretical versus Actual

MATHEMATICA

Table[Length[Select[Range[n!, n!+n^2], PrimeQ]], {n, 100}] (* T. D. Noe, Mar 06 2010 *)

PROG

(PARI) for(n=1, 75, print1(sum(k=n!, n!+n^2, isprime(k)), ", "))

CROSSREFS

Cf. A037151, A037153, A014085.

Sequence in context: A156349 A237526 A240117 * A002036 A090903 A022878

Adjacent sequences:  A069938 A069939 A069940 * A069942 A069943 A069944

KEYWORD

easy,nonn

AUTHOR

Benoit Cloitre, May 04 2002

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified November 28 16:44 EST 2014. Contains 250365 sequences.