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 A098547 #37 Apr 20 2025 12:33:18
%S A098547 1,3,13,37,81,151,253,393,577,811,1101,1453,1873,2367,2941,3601,4353,
%T A098547 5203,6157,7221,8401,9703,11133,12697,14401,16251,18253,20413,22737,
%U A098547 25231,27901,30753,33793,37027,40461,44101,47953,52023,56317,60841,65601,70603,75853
%N A098547 a(n) = n^3 + n^2 + 1.
%H A098547 G. C. Greubel, <a href="/A098547/b098547.txt">Table of n, a(n) for n = 0..10000</a>
%H A098547 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (4,-6,4,-1).
%F A098547 From _Colin Barker_, Aug 29 2014: (Start)
%F A098547 a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4).
%F A098547 G.f.: (1 - x + 7*x^2 - x^3)/(1-x)^4. (End)
%F A098547 a(n) = A081423(n) + A000217(n-1). - _Bruce J. Nicholson_, Jan 06 2019
%F A098547 E.g.f.: exp(x)*(1 + 2*x + 4*x^2 + x^3). - _Elmo R. Oliveira_, Apr 20 2025
%p A098547 with(combinat): seq(fibonacci(3,n)+n^3, n=0..40); # _Zerinvary Lajos_, May 25 2008
%t A098547 Table[n^3+n^2+1,{n,0,100}] (* _Vladimir Joseph Stephan Orlovsky_, Mar 09 2011 *)
%o A098547 (Magma) [(n^3+n^2+1): n in [1..60]]; // _Vincenzo Librandi_, Apr 06 2011
%o A098547 (PARI) Vec(-(x^3-7*x^2+x-1)/(x-1)^4 + O(x^100)) \\ _Colin Barker_, Aug 29 2014
%Y A098547 Cf. A000578, A001093, A011379, A027444, A033431, A033562, A034262, A053698, A061317, A066023, A071568.
%Y A098547 Cf. A000217, A081423.
%K A098547 nonn,easy
%O A098547 0,2
%A A098547 Douglas Winston (douglas.winston(AT)srupc.com), Oct 26 2004