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 A084381 #22 Sep 08 2022 08:45:11
%S A084381 5,6,13,32,69,130,221,348,517,734,1005,1336,1733,2202,2749,3380,4101,
%T A084381 4918,5837,6864,8005,9266,10653,12172,13829,15630,17581,19688,21957,
%U A084381 24394,27005,29796,32773,35942,39309,42880,46661,50658,54877,59324,64005
%N A084381 a(n) = n^3 + 5.
%H A084381 Vincenzo Librandi, <a href="/A084381/b084381.txt">Table of n, a(n) for n = 0..1000</a>
%H A084381 Cino Hilliard, <a href="https://web.archive.org/web/20080621104333/http://groups.msn.com:80/BC2LCC/n37ltk2.msnw">Proof that a cube plus 7 cannot be a square</a>
%H A084381 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (4,-6,4,-1).
%F A084381 G.f.: (5 - 14*x + 19*x^2 - 4*x^3)/(1 - x)^4. - _Vincenzo Librandi_, Jun 09 2016
%F A084381 a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4) for n>3. - _Vincenzo Librandi_, Jun 09 2016
%t A084381 Table[n^3 + 5, {n, 0, 60}] (* _Vladimir Joseph Stephan Orlovsky_, Apr 15 2011 *)
%o A084381 (PARI) a(n) = n^3 + 5;
%o A084381 (Magma) [n^3+5: n in [0..50]]; // _Vincenzo Librandi_, Jun 09 2016
%Y A084381 Cf. A000578, A084378.
%K A084381 easy,nonn
%O A084381 0,1
%A A084381 _Cino Hilliard_, Jun 23 2003
%E A084381 Offset 0 and a(0) = 5 by _Vincenzo Librandi_, Jun 09 2016