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 A063215 #18 Aug 25 2025 18:58:04
%S A063215 4,11,19,27,35,41,51,57,65,73,81,87,97,103,111,119,127,133,143,149,
%T A063215 157,165,173,179,189,195,203,211,219,225,235,241,249,257,265,271,281,
%U A063215 287,295,303,311,317,327,333,341,349,357,363,373,379
%N A063215 Dimension of the space of weight 2n cuspidal newforms for Gamma_0( 47 ).
%H A063215 William A. Stein, <a href="http://wstein.org/Tables/dimskg0new.gp">Dimensions of the spaces S_k^{new}(Gamma_0(N))</a>
%H A063215 William A. Stein, <a href="http://wstein.org/Tables/">The modular forms database</a>
%H A063215 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (0,1,1,0,-1).
%F A063215 a(n) = a(n-2)+a(n-3)-a(n-5) for n>6. G.f.: x*(4+11*x+15*x^2+12*x^3+5*x^4-x^5)/((1 -x)^2*(1 +x)*(1 +x +x^2)). - _Colin Barker_, Sep 27 2012
%t A063215 a[n_] := a[n] = If[n <= 6, {4, 11, 19, 27, 35, 41}[[n]], a[n-2] + a[n-3] - a[n-5]]; Array[a, 50] (* _Jean-François Alcover_, Dec 06 2016 after _Colin Barker_ *)
%t A063215 LinearRecurrence[{0,1,1,0,-1},{4,11,19,27,35,41},50] (* _Harvey P. Dale_, Aug 25 2025 *)
%o A063215 (PARI) a(n)=if(n>1, ([0,1,0,0,0; 0,0,1,0,0; 0,0,0,1,0; 0,0,0,0,1; -1,0,1,1,0]^(n-1)*[5;11;19;27;35])[1,1], 4) \\ _Charles R Greathouse IV_, Nov 27 2016
%K A063215 nonn,easy,changed
%O A063215 1,1
%A A063215 _N. J. A. Sloane_, Jul 10 2001