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 A095063 #14 Jun 13 2024 07:46:59 %S A095063 1,1,1,3,4,7,14,22,41,70,133,261,433,800,1468,2883,5445,10033,19388, %T A095063 36902,70168,134005,256771,493088,947153,1822376,3514806,6780667, %U A095063 13103439,25351723,49085715,95166843,184656849,358622060,697126872 %N A095063 Number of fibodious primes (A095083) in range [2^n,2^(n+1)]. %H A095063 Antti Karttunen and John Moyer, <a href="/A095062/a095062.c.txt">C-program for computing the initial terms of this sequence</a>. %H A095063 <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 A095063 a(n) = A036378(n) - A095064(n). %Y A095063 Cf. A036378, A095064, A095083. %K A095063 nonn,more %O A095063 1,4 %A A095063 _Antti Karttunen_, Jun 01 2004 %E A095063 a(34)-a(35) from _Amiram Eldar_, Jun 13 2024