login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

a(n) = 100*n^2 - 2*n.
1

%I #25 Sep 12 2024 18:50:25

%S 0,98,396,894,1592,2490,3588,4886,6384,8082,9980,12078,14376,16874,

%T 19572,22470,25568,28866,32364,36062,39960,44058,48356,52854,57552,

%U 62450,67548,72846,78344,84042,89940,96038,102336,108834,115532,122430,129528

%N a(n) = 100*n^2 - 2*n.

%H Vincenzo Librandi, <a href="/A158129/b158129.txt">Table of n, a(n) for n = 0..10000</a>

%H <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (3,-3,1).

%F a(n) = 3*a(n-1) -3*a(n-2) +a(n-3).

%F G.f.: x*(98+102*x)/(1-x)^3.

%t Table[100n^2-2n,{n,50}]

%o (Magma) I:=[98, 396, 894]; [n le 3 select I[n] else 3*Self(n-1)-3*Self(n-2)+Self(n-3): n in [1..50]];

%o (PARI) a(n) = 100*n^2 - 2*n

%K nonn,easy

%O 0,2

%A _Vincenzo Librandi_, Mar 13 2009

%E a(0)=0 prepended by _Andrew Howroyd_, Sep 12 2024