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 A004769 #28 Mar 23 2025 12:37:06
%S A004769 11,19,27,35,43,51,59,67,75,83,91,99,107,115,123,131,139,147,155,163,
%T A004769 171,179,187,195,203,211,219,227,235,243,251,259,267,275,283,291,299,
%U A004769 307,315,323,331,339,347,355,363,371,379,387,395,403,411,419,427,435,443,451,459,467,475,483,491
%N A004769 Numbers whose binary expansion ends in 011.
%H A004769 Vincenzo Librandi, <a href="/A004769/b004769.txt">Table of n, a(n) for n = 0..10000</a>
%H A004769 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H A004769 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).
%F A004769 a(n) = 8*n + 11. - _Vincenzo Librandi_, Jul 12 2011
%F A004769 From _G. C. Greubel_, Oct 13 2018: (Start)
%F A004769 a(n) = 2*a(n-1) - a(n-2).
%F A004769 G.f.: (11 - 3*x)/(1-x)^2.
%F A004769 E.g.f.: (8*x + 11)*exp(x). (End)
%t A004769 Table[8*n+11, {n,0,60}] (* _G. C. Greubel_, Oct 13 2018 *)
%t A004769 LinearRecurrence[{2,-1},{11,19},80] (* _Harvey P. Dale_, Aug 09 2023 *)
%t A004769 Select[Range[10,500],Take[IntegerDigits[#,2],-3]=={0,1,1}&] (* or *) Rest[FromDigits[#,2]&/@(Join[#,{0,1,1}]&/@Tuples[{0,1},6])] (* _Harvey P. Dale_, Mar 23 2025 *)
%o A004769 (Magma) [8*n+11: n in [0..60]]; // _Vincenzo Librandi_, Jul 12 2011
%o A004769 (PARI) a(n)=8*n+11 \\ _Charles R Greathouse IV_, Jul 11 2016
%Y A004769 Essentially same as A017101.
%K A004769 nonn,easy,base
%O A004769 0,1
%A A004769 _N. J. A. Sloane_