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 A095067 #12 Jun 13 2024 08:16:45 %S A095067 0,1,0,2,1,2,4,11,23,33,59,108,205,364,709,1368,2546,4789,9111,17259, %T A095067 33075,63340,121467,232396,446774,860552,1659065,3203164,6187452, %U A095067 11968853,23171558,44926416,87186186,169306460,329138934 %N A095067 Number of fib010 primes (A095087) in range [2^n,2^(n+1)]. %H A095067 Antti Karttunen and John Moyer, <a href="/A095062/a095062.c.txt">C-program for computing the initial terms of this sequence</a>. %H A095067 <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 A095067 a(n) = A095060(n) - A095062(n). %Y A095067 Cf. A095060, A095062, A095087. %K A095067 nonn,more %O A095067 1,4 %A A095067 _Antti Karttunen_, Jun 01 2004 %E A095067 a(34)-a(35) from _Amiram Eldar_, Jun 13 2024