login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A112524 a(n) = a(n-1) + 2*n^2 with a(1) = 1. 2

%I #23 Jan 12 2022 03:17:10

%S 1,9,27,59,109,181,279,407,569,769,1011,1299,1637,2029,2479,2991,3569,

%T 4217,4939,5739,6621,7589,8647,9799,11049,12401,13859,15427,17109,

%U 18909,20831,22879,25057,27369,29819,32411,35149,38037,41079,44279,47641

%N a(n) = a(n-1) + 2*n^2 with a(1) = 1.

%C This is the total number of operations or total storage if a process first replaces a square array by an array one smaller, repeatedly down to 1 and then regrows the array to the original size.

%H Harvey P. Dale, <a href="/A112524/b112524.txt">Table of n, a(n) for n = 1..1000</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Condensation.html">Condensation</a>

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

%F Twice the sum of the first n square numbers - 1 = n*(n + 1)*(2n + 1)/3 - 1. - _Stefan Steinerberger_, Mar 11 2006

%F From _R. J. Mathar_, Sep 09 2008: (Start)

%F G.f.: x*(1 +5*x -3*x^2 +x^3)/(1-x)^4.

%F a(n) = A006331(n) - 1. (End)

%F a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4), a(1)=1, a(2)=9, a(3)=27, a(4)=59. - _Harvey P. Dale_, Dec 03 2012

%F E.g.f.: ( 3 + (-3 + 6*x + 9*x^2 + 2*x^3)*exp(x) )/3. - _G. C. Greubel_, Jan 12 2022

%p a[1]:=1: for n from 2 to 50 do a[n]:=a[n-1]+2*n^2 od: seq(a[n],n=1..50); # _Emeric Deutsch_, Feb 13 2006

%p a:=n->sum(k^2, k=1..n):seq(a(n)+sum(k^2, k=2..n), n=1...40); # _Zerinvary Lajos_, Jun 11 2008

%t Table[n*(n+1)*(2n+1)/3 - 1, {n, 50}] (* _Stefan Steinerberger_, Mar 11 2006 *)

%t 2*Accumulate[Range[50]^2]-1 (* or *) LinearRecurrence[{4,-6,4,-1},{1,9,27,59},50] (* _Harvey P. Dale_, Dec 03 2012 *)

%o (Sage) [n*(n+1)*(2*n+1)/3 - 1 for n in (1..40)] # _G. C. Greubel_, Jan 12 2022

%o (Magma) [n*(n+1)*(2*n+1)/3 - 1: n in [1..40]]; // _G. C. Greubel_, Jan 12 2022

%Y Cf. A006331.

%K easy,nonn

%O 1,2

%A Dennis Farr (dfarr(AT)comcast.net), Dec 13 2005

%E Definition corrected by _Alexandre Wajnberg_, Jan 02 2006

%E More terms from _Emeric Deutsch_, Feb 13 2006

%E More terms from _Stefan Steinerberger_, Mar 11 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 23:26 EDT 2024. Contains 371917 sequences. (Running on oeis4.)