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 A095069 #10 Jun 13 2024 08:16:37 %S A095069 0,0,0,1,1,3,1,9,10,20,42,64,126,251,440,828,1560,2967,5656,10769, %T A095069 20419,39327,74826,143516,276217,531587,1025104,1977596,3821827, %U A095069 7396083,14326142,27774012,53875302,104653661,203380716 %N A095069 Number of fib101 primes (A095089) in range ]2^n,2^(n+1)]. %H A095069 Antti Karttunen and John Moyer, <a href="/A095062/a095062.c.txt">C-program for computing the initial terms of this sequence</a>. %H A095069 <a href="/index/Pri#primesubsetpop2">Index entries for sequences related to occurrences of various subsets of primes in range ]2^n,2^(n+1)]</a>. %F A095069 a(n) = A095061(n) - A095066(n). %Y A095069 Cf. A095061, A095066, A095089. %K A095069 nonn,more %O A095069 1,6 %A A095069 _Antti Karttunen_, Jun 01 2004 %E A095069 a(34)-a(35) from _Amiram Eldar_, Jun 13 2024