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

 


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A134850 Number of primes between A075737(n) and A075737(n+1), including one bound. 1

%I #13 May 14 2023 02:33:49

%S 2,3,18,27,200,2870,39492,22980943,120106923,2602986018837012

%N Number of primes between A075737(n) and A075737(n+1), including one bound.

%H Kim Walisch, <a href="https://github.com/kimwalisch/primecount">Fast C++ prime counting function implementation (primecount)</a>.

%t a = {}; k = {}; Do[If[PrimeQ[Fibonacci[Prime[n]]], AppendTo[k, Fibonacci[Prime[n]]]], {n, 1, 100}];Do[AppendTo[a, PrimePi[k[[n + 1]]] - PrimePi[k[[n]]]], {n, 1, 9}]; a

%Y Cf. A000045, A050937, A075737, A090819, A134787, A307499.

%K nonn,more

%O 1,1

%A _Artur Jasinski_, Nov 13 2007

%E Edited by _N. J. A. Sloane_, Oct 07 2008

%E a(10) using Kim Walisch's primecount, from _Amiram Eldar_, May 14 2023

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | 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 September 19 13:45 EDT 2024. Contains 376012 sequences. (Running on oeis4.)