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 A004768 #41 Sep 08 2022 08:44:33
%S A004768 9,17,25,33,41,49,57,65,73,81,89,97,105,113,121,129,137,145,153,161,
%T A004768 169,177,185,193,201,209,217,225,233,241,249,257,265,273,281,289,297,
%U A004768 305,313,321,329,337,345,353,361,369,377,385,393,401,409,417,425,433,441,449,457,465,473,481,489
%N A004768 Binary expansion ends 001.
%C A004768 Apart from initial term(s), dimension of the space of weight 2n cusp forms for Gamma_0( 28 ).
%H A004768 Vincenzo Librandi, <a href="/A004768/b004768.txt">Table of n, a(n) for n = 0..10000</a>
%H A004768 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H A004768 William A. Stein, <a href="http://wstein.org/Tables/dimskg0n.gp">Dimensions of the spaces S_k(Gamma_0(N))</a>
%H A004768 William A. Stein, <a href="http://wstein.org/Tables/">The modular forms database</a>
%H A004768 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).
%F A004768 From _Reinhard Zumkeller_, Oct 30 2008: (Start)
%F A004768 a(n) = 8*n + 9.
%F A004768 For n > 0: a(n) = A017077(n-1). (End)
%F A004768 a(n) = 2*a(n-1) - a(n-2); a(0)=9, a(1)=17. - _Harvey P. Dale_, May 10 2015
%F A004768 G.f.: (9 - x) / (1 - x)^2. - _Colin Barker_, Jul 04 2019
%F A004768 E.g.f.: exp(x)*(9 + 8*x). - _Stefano Spezia_, May 13 2021
%t A004768 Rest[FromDigits[#,2]&/@(Join[#,{0,0,1}]&/@Tuples[{0,1},7])] (* or *) LinearRecurrence[{2,-1},{9,17},100] (* _Harvey P. Dale_, May 10 2015 *)
%o A004768 (Magma) [8*n + 9: n in [0..60]]; // _Vincenzo Librandi_, Jul 11 2011
%o A004768 (PARI) a(n) = 8*n+9 \\ _Charles R Greathouse IV_, Sep 24 2012
%o A004768 (PARI) Vec((9 - x) / (1 - x)^2 + O(x^50)) \\ _Colin Barker_, Jul 04 2019
%o A004768 (Python)
%o A004768 def a(n): return 8*n + 9
%o A004768 print([a(n) for n in range(61)]) # _Michael S. Branicky_, Sep 17 2021
%Y A004768 Complement of A004774.
%Y A004768 Cf. A017077.
%Y A004768 Cf. A146302. - _Reinhard Zumkeller_, Oct 30 2008
%K A004768 nonn,easy
%O A004768 0,1
%A A004768 _N. J. A. Sloane_