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.

A027441 a(n) = (n^4 + n)/2 (Row sums of an n X n X n magic cube, when it exists).

Original entry on oeis.org

0, 1, 9, 42, 130, 315, 651, 1204, 2052, 3285, 5005, 7326, 10374, 14287, 19215, 25320, 32776, 41769, 52497, 65170, 80010, 97251, 117139, 139932, 165900, 195325, 228501, 265734, 307342, 353655, 405015, 461776, 524304, 592977, 668185, 750330, 839826, 937099
Offset: 0

Views

Author

Keywords

Comments

Starting with offset 1 = binomial transform of (1, 8, 25, 30, 12, 0, 0, 0, ...). - Gary W. Adamson, May 20 2009

Crossrefs

Subsequence of A057590.

Programs

Formula

O.g.f.: x*(1+4*x+7*x^2)/(1-x)^5. - R. J. Mathar, Feb 13 2008
a(n) = Sum_{k=n..n^2} k; for n>0: a(n) = A037270(n) - A000217(n-1). - Reinhard Zumkeller, Jul 06 2010
a(n) = 5*a(n-1) - 10*a(n-2) + 10*a(n-3) - 5*a(n-4) + a(n-5). - Wesley Ivan Hurt, Aug 13 2014
a(n) = A071232(n) / n^2, for n > 0. - Wesley Ivan Hurt, Aug 13 2014
a(n) = A002061(n)*A000217(n). - Anton Zakharov, Dec 16 2016
a(n) = (n+1)*(a(n-1)/(n-1) + n*(n-1)), a(0)=0, a(1)=1. - Vladimir Kruchinin, Oct 10 2018

Extensions

More terms from Wesley Ivan Hurt, Aug 13 2014