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 A095064 #10 Jun 13 2024 08:16:58 %S A095064 0,1,1,2,3,6,9,21,34,67,122,203,439,812,1562,2826,5304,10357,19247, %T A095064 36684,70168,134211,256937,492730,946967,1823368,3512484,6781240, %U A095064 13103839,25345814,49096941,95168742,184666456,358645108,697065364 %N A095064 Number of fibevil primes (A095084) in range ]2^n,2^(n+1)]. %H A095064 Antti Karttunen and John Moyer, <a href="/A095062/a095062.c.txt">C-program for computing the initial terms of this sequence</a>. %H A095064 <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 A095064 a(n) = A036378(n) - A095063(n). %Y A095064 Cf. A036378, A095063, A095084. %K A095064 nonn,more %O A095064 1,4 %A A095064 _Antti Karttunen_, Jun 01 2004 %E A095064 a(34)-a(35) from _Amiram Eldar_, Jun 13 2024