A095354 Number of primes p such that Fib(n+1) <= p < Fib(n+2), (where Fib = A000045).

0, 1, 1, 2, 1, 3, 3, 5, 7, 11, 16, 24, 37, 55, 84, 126, 198, 297, 458, 704, 1087, 1674, 2602, 4029, 6263, 9738, 15186, 23705, 36981, 57909, 90550, 142033, 222855, 349862, 549903, 865019, 1361581, 2145191, 3381318, 5334509, 8419527, 13298631

Offset: 1

Author

Antti Karttunen, Jun 04 2004

Keywords

• nonn

Examples

			I.e. gives the number of primes whose Zeckendorf-expansion is n fibits long. a(1) = a(2) = 0, as there are no primes in ranges [1,2[ and [2,3[. a(3)=1 as in [3,5[ there is prime 3 with Fibonacci-representation 100. a(4)=2, as in [5,8[ there are primes 5 and 7. a(5)=1, as in [8,13[ there is only one prime 11 and a(6)=3 as in [13,21[ there are primes 13,17,19.
		

Links

• Chai Wah Wu, Table of n, a(n) for n = 1..100
• A. Karttunen and J. Moyer: C-program for computing the initial terms of this sequence
• Index entries for sequences related to numbers of primes in various ranges

Crossrefs

Cf. A095353, A036378.

Extensions

a(2) corrected by Chai Wah Wu, Jan 16 2020