login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A307384 Decimal expansion of the constant S_1* = Sum_{j>=1} prime((2*j) - 1)!/prime((2*j + 1) - 1)!. 1
0, 8, 5, 1, 6, 1, 9, 1, 0, 9, 8, 5 (list; constant; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
Together with the constant S_2* and S_1* + S_2* (see A307383), S_1* involves the prime gaps, since twin primes produce the heaviest terms of the summation in comparison to their next and previous addend.
On Apr 06 2019, the first 4200000000 prime numbers were used and using Rosser's theorem we get: 0.08516191098523 < S_1* < 0.08516191098543.
LINKS
Wikipedia, Rosser's theorem
FORMULA
S_1* = Sum_{j>=1} prime(2*j - 1)!/prime((2*j + 1) - 1)! = Sum_{j>=1} 1/(Product{k=prime(2*j), prime(2*j + 1)} k) = 1/(3*4) + 1/(7*8*9*10) + 1/(13*14*15*16) + 1/(19*20*21*22) +...
EXAMPLE
S_1* = 0.085161910985...
CROSSREFS
Cf. A000040, A306658 (S_1) A306700 (S_2), A306744 (S_1 + S_2), A307383 (S_1* + S_2*).
Sequence in context: A334496 A258988 A139721 * A261882 A021058 A036792
KEYWORD
cons,nonn,more
AUTHOR
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 18:58 EDT 2024. Contains 371781 sequences. (Running on oeis4.)