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 A095065 #10 Jun 13 2024 08:16:49 %S A095065 0,1,1,1,1,4,9,6,19,28,54,109,210,373,707,1316,2497,4827,9127,17467, %T A095065 33212,63161,121404,232455,446846,860466,1658020,3200462,6184814, %U A095065 11971998,23184215,44934259,87179855,169330402,329113635 %N A095065 Number of fib000 primes (A095085) in range ]2^n,2^(n+1)]. %H A095065 Antti Karttunen and John Moyer, <a href="/A095062/a095062.c.txt">C-program for computing the initial terms of this sequence</a>. %H A095065 <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 A095065 a(n) = A095062(n) - A095068(n). %Y A095065 Cf. A095062, A095066, A095067, A095068, A095085. %K A095065 nonn,more %O A095065 1,6 %A A095065 _Antti Karttunen_, Jun 01 2004 %E A095065 a(34)-a(35) from _Amiram Eldar_, Jun 13 2024