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 A095061 #12 Jun 13 2024 08:17:02 %S A095061 0,0,0,2,4,4,7,18,25,54,105,178,332,637,1165,2194,4161,7770,14800, %T A095061 28100,53525,102394,195938,377301,723938,1391620,2684760,5178439, %U A095061 10010119,19362205,37501838,72702221,141062816,273985225,532514962 %N A095061 Number of fibodd primes (A095081) in range [2^n,2^(n+1)]. %H A095061 Antti Karttunen and John Moyer, <a href="/A095062/a095062.c.txt">C-program for computing the initial terms of this sequence</a>. %H A095061 <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 A095061 a(n) = A036378(n) - A095060(n) = A095066(n) + A095069(n). %Y A095061 Cf. A036378, A095060, A095066, A095069, A095081. %K A095061 nonn,more %O A095061 1,4 %A A095061 _Antti Karttunen_, Jun 01 2004 %E A095061 a(34)-a(35) from _Amiram Eldar_, Jun 13 2024