Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A161892
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A161892 Numerators of the partial sums of S(n) = Sum[(Pi((n+1)^2) - Pi(n^2))/(Pi((n+1)^2)*Pi(n^2)), n from 2 to oo. Pi(n) = number of primes <= n. +0
2
1, 1, 7, 9, 13, 4, 5, 23, 7 (list; graph; listen)
OFFSET

1,3

COMMENT

The sum converges rapidly to 1/2. For 100 summands, S(n)= 0.4992...; for 500, S(n) = 0.49995...S(n) generalizes to: S_k(n)= Sum[(Pi((n+k)^2)-Pi((n+k-1)^2))/(Pi((n+k)^2)*Pi((n+k-1)^2))),n=2 to oo, k =1,2,3,...For k =1, the analogous series for C(n),composites <= n, appears to converge to 1.

EXAMPLE

First few terms of sequence are: 1/4,1/3,7/18,9/22,13/30,4/9,5/11,23/50,7/15,...

MATHEMATICA

Table[Sum[(PrimePi[(i+1)^2]-PrimePi[i^2])/(PrimePi[(i+1)^2]*PrimePi[i^2]), {i, 2, j}], {j, 2, 50}]

CROSSREFS

Cf. A161621

Sequence in context: A048589 A121056 A112529 this_sequence A056528 A055565 A066498

Adjacent sequences: A161889 A161890 A161891 this_sequence A161893 A161894 A161895

KEYWORD

nonn,frac

AUTHOR

Daniel Tisdale (daniel6874(AT)gmail.com), Jun 21 2009

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 December 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research