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 A197602 #21 Mar 19 2023 14:12:32 %S A197602 8,15,37,76,140,234,364,536,756,1030,1364,1764,2236,2786,3420,4144, %T A197602 4964,5886,6916,8060,9324,10714,12236,13896,15700,17654,19764,22036, %U A197602 24476,27090,29884,32864,36036,39406,42980,46764,50764,54986,59436,64120,69044,74214,79636,85316,91260,97474,103964,110736,117796,125150 %N A197602 Floor((n+1/n)^3). %H A197602 Vincenzo Librandi, <a href="/A197602/b197602.txt">Table of n, a(n) for n = 1..10000</a> %H A197602 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (4,-6,4,-1). %F A197602 From _Bruno Berselli_, Oct 17 2011: (Start) %F A197602 G.f.: x*(8-17*x+25*x^2-14*x^3+6*x^4-3*x^5+x^6)/(1-x)^4. %F A197602 a(n) = 4*a(n-1)-6*a(n-2)+4*a(n-3)-a(n-4) for n>7. %F A197602 a(n) = A079908(n) for n>3. (End) %o A197602 (Magma) [Floor((n+1/n)^3): n in [1..60]] %o A197602 (PARI) a(n)=n^3+3*n+(3*n^2+1)\n^3 \\ _Charles R Greathouse IV_, Oct 07 2015 %Y A197602 Cf. A079908, A014052. %K A197602 nonn,easy %O A197602 1,1 %A A197602 _Vincenzo Librandi_, Oct 17 2011