This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A095354 #10 Jan 16 2020 19:57:45 %S A095354 0,1,1,2,1,3,3,5,7,11,16,24,37,55,84,126,198,297,458,704,1087,1674, %T A095354 2602,4029,6263,9738,15186,23705,36981,57909,90550,142033,222855, %U A095354 349862,549903,865019,1361581,2145191,3381318,5334509,8419527,13298631 %N A095354 Number of primes p such that Fib(n+1) <= p < Fib(n+2), (where Fib = A000045). %H A095354 Chai Wah Wu, <a href="/A095354/b095354.txt">Table of n, a(n) for n = 1..100</a> %H A095354 A. Karttunen and J. Moyer: <a href="/A095062/a095062.c.txt">C-program for computing the initial terms of this sequence</a> %H A095354 <a href="/index/Pri#primepop">Index entries for sequences related to numbers of primes in various ranges</a> %e A095354 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. %Y A095354 Cf. A095353, A036378. %K A095354 nonn %O A095354 1,4 %A A095354 _Antti Karttunen_, Jun 04 2004 %E A095354 a(2) corrected by _Chai Wah Wu_, Jan 16 2020