cp's OEIS Frontend

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.

A153056 a(0)=2, a(n) = n^2+a(n-1).

This page as a plain text file.
%I A153056 #21 Sep 06 2023 09:46:50
%S A153056 2,3,7,16,32,57,93,142,206,287,387,508,652,821,1017,1242,1498,1787,
%T A153056 2111,2472,2872,3313,3797,4326,4902,5527,6203,6932,7716,8557,9457,
%U A153056 10418,11442,12531,13687,14912,16208,17577,19021,20542,22142,23823,25587
%N A153056 a(0)=2, a(n) = n^2+a(n-1).
%H A153056 Shawn A. Broyles, <a href="/A153056/b153056.txt">Table of n, a(n) for n = 0..1000</a>
%H A153056 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (4,-6,4,-1).
%F A153056 G.f.: (2-5x+7x^2-2x^3)/(1-x)^4. a(n)=2+n(1+2n^2+3n)/6 = 2+A000330(n). - _R. J. Mathar_, Jan 08 2009
%t A153056 a=2;lst={};Do[a=n^2+a;AppendTo[lst,a],{n,0,5!}];lst
%t A153056 nxt[{n_,a_}]:={n+1,(n+1)^2+a}; NestList[nxt,{0,2},50][[;;,2]] (* or *) LinearRecurrence[{4,-6,4,-1},{2,3,7,16},50] (* _Harvey P. Dale_, Sep 05 2023 *)
%o A153056 (PARI) a(n) = n*(n+1)*(2*n+1)/6 + 2; \\ _Altug Alkan_, Apr 30 2018
%Y A153056 Cf. A000330, A056520, A153057, A153058, A179904.
%K A153056 nonn,easy
%O A153056 0,1
%A A153056 _Vladimir Joseph Stephan Orlovsky_, Dec 17 2008