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 A004774 #30 Aug 10 2016 12:09:02
%S A004774 0,1,2,3,4,5,6,7,8,10,11,12,13,14,15,16,18,19,20,21,22,23,24,26,27,28,
%T A004774 29,30,31,32,34,35,36,37,38,39,40,42,43,44,45,46,47,48,50,51,52,53,54,
%U A004774 55,56,58,59,60,61,62,63,64,66,67,68,69,70,71,72,74,75,76,77
%N A004774 Numbers n whose binary expansion does not end in 001.
%C A004774 Numbers less than 8 or not congruent to 1 (mod 8). - _M. F. Hasler_, Nov 02 2013
%H A004774 Colin Barker, <a href="/A004774/b004774.txt">Table of n, a(n) for n = 1..1000</a>
%H A004774 <a href="/index/Rec#order_08">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,0,0,0,1,-1).
%F A004774 From _Colin Barker_, Jul 23 2016: (Start)
%F A004774 a(n) = a(n-1)+a(n-7)-a(n-8) for n>8.
%F A004774 G.f.: x^2*(1+x+x^2+x^3+x^4+x^5+x^6+x^8) / ((1-x)^2*(1+x+x^2+x^3+x^4+x^5+x^6)).
%F A004774 (End)
%F A004774 a(1) = 0, a(2) = 1, a(7*n + k + 2) = 8*n + k + 1, n >= 0, 1 <= k < 8. - _Yosu Yurramendi_, Aug 09 2016
%t A004774 Join[Range[0, 3], Select[Range[4, 80], Take[IntegerDigits[#, 2], -3] != {0, 0, 1} &]] (* _Harvey P. Dale_, Feb 18 2011 *)
%t A004774 Table[If[n < 9, n - 1, Floor[(8 n - 10)/7]], {n, 69}] (* or *)
%t A004774 Rest@ CoefficientList[Series[x^2 (1 + x + x^2 + x^3 + x^4 + x^5 + x^6 + x^8)/((1 - x)^2*(1 + x + x^2 + x^3 + x^4 + x^5 + x^6)), {x, 0, 69}], x] (* _Michael De Vlieger_, Aug 10 2016 *)
%o A004774 (PARI) a(n)=if(n<9,n-1,(8*n-10)\7) \\ _Charles R Greathouse IV_, Mar 26 2013
%o A004774 (PARI) concat(0, Vec(x^2*(1+x+x^2+x^3+x^4+x^5+x^6+x^8)/((1-x)^2*(1+x+x^2+x^3+x^4+x^5+x^6)) + O(x^100))) \\ _Colin Barker_, Jul 23 2016
%K A004774 nonn,easy
%O A004774 1,3
%A A004774 _N. J. A. Sloane_