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 A095066 #10 Jun 13 2024 08:16:54 %S A095066 0,0,0,1,3,1,6,9,15,34,63,114,206,386,725,1366,2601,4803,9144,17331, %T A095066 33106,63067,121112,233785,447721,860033,1659656,3200843,6188292, %U A095066 11966122,23175696,44928209,87187514,169331564,329134246 %N A095066 Number of fib001 primes (A095086) in range ]2^n,2^(n+1)]. %H A095066 Antti Karttunen and John Moyer, <a href="/A095062/a095062.c.txt">C-program for computing the initial terms of this sequence</a>. %H A095066 <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 A095066 a(n) = A095061(n) - A095069(n). %Y A095066 Cf. A095061, A095065, A095067, A095069, A095086. %K A095066 nonn,more %O A095066 1,5 %A A095066 _Antti Karttunen_, Jun 01 2004 %E A095066 a(34)-a(35) from _Amiram Eldar_, Jun 13 2024