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 A140679 #22 Aug 31 2025 18:48:45
%S A140679 0,17,40,69,104,145,192,245,304,369,440,517,600,689,784,885,992,1105,
%T A140679 1224,1349,1480,1617,1760,1909,2064,2225,2392,2565,2744,2929,3120,
%U A140679 3317,3520,3729,3944,4165,4392,4625,4864,5109,5360,5617,5880,6149,6424,6705,6992
%N A140679 a(n) = n*(3*n+14).
%H A140679 G. C. Greubel, <a href="/A140679/b140679.txt">Table of n, a(n) for n = 0..5000</a>
%H A140679 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (3,-3,1).
%F A140679 a(n) = 3*n^2 + 14*n.
%F A140679 a(n) = a(n-1) + 6*n + 11, with a(0)=0. - _Vincenzo Librandi_, Aug 03 2010
%F A140679 a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3), with a(1)=0, a(2)=17, a(3)=40. - _Harvey P. Dale_, Apr 29 2011
%F A140679 E.g.f.: (3*x^2 + 17*x)*exp(x). - _G. C. Greubel_, Jul 20 2017
%e A140679 a(1)=6*1+0+11=17; a(2)=6*2+17+11=40; a(3)=6*3+40+11=69. See 2nd formula.
%t A140679 Table[n(3n+14),{n,0,50}] (* or *) LinearRecurrence[{3,-3,1},{0,17,40},50] (* _Harvey P. Dale_, Apr 29 2011 *)
%o A140679 (PARI) a(n)=n*(3*n+14) \\ _Charles R Greathouse IV_, Oct 07 2015
%Y A140679 Cf. A033428, A045944, A140676, A067725, A140677, A140678, A067707, A140680, A140681, A140689.
%K A140679 easy,nonn,changed
%O A140679 0,2
%A A140679 _Omar E. Pol_, May 22 2008