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 A173562 #21 Feb 02 2023 15:25:25 %S A173562 0,1,4,9,17,26,37,50,66,83,102,123,147,172,199,228,260,293,328,365, %T A173562 405,446,489,534,582,631,682,735,791,848,907,968,1032,1097,1164,1233, %U A173562 1305,1378,1453,1530,1610,1691,1774,1859,1947,2036,2127,2220,2316,2413,2512 %N A173562 a(n) = n^2 + floor(n/4). %H A173562 <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1,0,1,-2,1). %F A173562 a(n) = A002378(n)-A057353(n) = A035608(n)-A002265(n+2) = A000290(n)+A002265(n); %F A173562 a(n+1) - a(n) = A047624(n+2). %F A173562 a(n) = floor((n + 1/8)^2). %F A173562 a(n) = 2*a(n-1) - a(n-2) + a(n-4) - 2*a(n-5) + a(n-6) for n>5. %F A173562 G.f.: x*(1+2*x+2*x^2+3*x^3)/((1+x)*(x^2+1)*(1-x)^3). - _R. J. Mathar_, Feb 27 2010 %F A173562 a(n) = (8*n^2+2*n-3+i^(2*n)+(1+i)*i^(-n)+(1-i)*i^n)/8 where i=sqrt(-1). - _Wesley Ivan Hurt_, Jun 04 2016 %p A173562 A173562:=n->floor((n + 1/8)^2): seq(A173562(n), n=0..80); # _Wesley Ivan Hurt_, Jun 04 2016 %t A173562 Table[n^2+Floor[n/4],{n,0,50}] (* or *) LinearRecurrence[{2,-1,0,1,-2,1}, {0,1,4,9,17,26}, 50] (* _Harvey P. Dale_, Nov 25 2011 *) %o A173562 (PARI) a(n)=n^2+n\4 \\ _Charles R Greathouse IV_, Oct 16 2015 %o A173562 (Magma) [Floor((n + 1/8)^2) : n in [0..80]]; // _Wesley Ivan Hurt_, Jun 04 2016 %o A173562 (Python) %o A173562 def A173562(n): return n**2+(n>>2) # _Chai Wah Wu_, Feb 02 2023 %Y A173562 Cf. A000290, A002265, A002378, A035608, A047624, A057353. %K A173562 nonn,easy %O A173562 0,3 %A A173562 _Reinhard Zumkeller_, Feb 21 2010