|
|
A071270
|
|
a(n) = n^2*(2*n^2+1)/3.
|
|
3
|
|
|
0, 1, 12, 57, 176, 425, 876, 1617, 2752, 4401, 6700, 9801, 13872, 19097, 25676, 33825, 43776, 55777, 70092, 87001, 106800, 129801, 156332, 186737, 221376, 260625, 304876, 354537, 410032, 471801, 540300, 616001, 699392, 790977, 891276, 1000825, 1120176
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
REFERENCES
|
T. A. Gulliver, Sequences from Arrays of Integers, Int. Math. Journal, Vol. 1, No. 4, pp. 323-332, 2002.
|
|
LINKS
|
|
|
FORMULA
|
a(n) = 5*a(n-1) - 10*a(n-2) + 10*a(n-3) - 5*a(n-4) + a(n-5), with n>4, a(0)=0, a(1)=1, a(2)=12, a(3)=57, a(4)=176. [Yosu Yurramendi, Sep 03 2013]
|
|
MAPLE
|
|
|
MATHEMATICA
|
LinearRecurrence[{5, -10, 10, -5, 1}, {0, 1, 12, 57, 176}, 50] (* Harvey P. Dale, Jan 09 2016 *)
|
|
PROG
|
(R)
a <- c(0, 1, 12, 57, 176)
for(n in (length(a)+1):30)
a[n] <- 5*a[n-1]-10*a[n-2]+10*a[n-3]-5*a[n-4]+a[n-5]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|