Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A114961
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A114961 Numbers n such that PrimePi(prime(n + 1)^2) - PrimePi(prime(n)^2) < c*n with c=9/5. +0
1
7, 10, 13, 20, 26, 28, 33, 35, 43, 45, 49, 52, 57, 60, 64, 89, 98, 109, 113, 116, 120, 140, 142, 144, 148, 152, 171, 173, 176, 178, 182, 190, 201, 209, 212, 215, 225, 230, 234, 236, 253, 256, 262, 265, 268, 277, 286, 288, 294, 296, 302, 307, 313, 315, 318, 320 (list; graph; listen)
OFFSET

1,1

COMMENT

If c=2 instead of 1.8 then the sequence is A029707.

This sequence is probably finite with 699 terms with 14020 being the last.

If c=1.7 the sequence is just {7, 10, 13, 20, 26, 28, 33, 35, 45, 49, 57, 60, 64, 89, 98, 109, 113, 116, 171, 190, 201, 215, 225, 234, 236, 256, 288, 332, 384, 405, 430, 486, 495, 498, 524, 530, 601, 613, 625, 872}.

If c=1.6 the sequence is just {7, 13, 20, 28, 33, 57, 109}.

If c=3/2 the sequence has but one term, 33.

REFERENCES

P. Ribenboim, The New Book of Prime Number Records, Springer-Verlag, NY, 1995, page 248.

MATHEMATICA

t = {}; Do[ If[ PrimePi[ Prime[n + 1]^2] - PrimePi[ Prime[n]^2] < 9n/5, AppendTo[t, n]], {n, 10^5}]; t

CROSSREFS

Cf. A029707.

Sequence in context: A026319 A120153 A007770 this_sequence A123834 A064629 A059752

Adjacent sequences: A114958 A114959 A114960 this_sequence A114962 A114963 A114964

KEYWORD

nonn

AUTHOR

Robert G. Wilson v (rgwv(AT)rgwv.com), Feb 21 2006

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 November 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research