|
Search: id:A112524
|
|
|
| A112524 |
|
a(1)=1; a(n) = a(n-1) + 2*n^2. |
|
+0
1
|
|
| 1, 9, 27, 59, 109, 181, 279, 407, 569, 769, 1011, 1299, 1637, 2029, 2479, 2991, 3569, 4217, 4939, 5739, 6621, 7589, 8647, 9799, 11049, 12401, 13859, 15427, 17109, 18909, 20831, 22879, 25057, 27369, 29819, 32411, 35149, 38037, 41079, 44279, 47641
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
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.
|
|
LINKS
|
Eric Weisstein's World of Mathematics, Lewis Carrol Determinant Formula
|
|
FORMULA
|
Twice the sum of the first n square numbers - 1 = n*(n + 1)*(2n + 1)/3 - 1 - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Mar 11 2006
|
|
MAPLE
|
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 (deutsch(AT)duke.poly.edu), Feb 13 2006
a:=n->sum(k^2, k=1..n):seq(a(n)+sum(k^2, k=2..n), n=1...40); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jun 11 2008
|
|
MATHEMATICA
|
Table[n*(n + 1)*(2n + 1)/3 - 1, {n, 1, 50}] - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Mar 11 2006
|
|
CROSSREFS
|
Sequence in context: A069068 A051412 A027468 this_sequence A011923 A029875 A129957
Adjacent sequences: A112521 A112522 A112523 this_sequence A112525 A112526 A112527
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Dennis Farr (dfarr(AT)comcast.net), Dec 13 2005
|
|
EXTENSIONS
|
Definition corrected by Alexandre Wajnberg (alexandre.wajnberg(AT)skynet.be), Jan 02 2006
More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Feb 13 2006
More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Mar 11 2006
|
|
|
Search completed in 0.002 seconds
|
