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.

Showing 1-1 of 1 results.

A256288 Sum of all the parts in the partitions of 7n into 7 parts.

Original entry on oeis.org

0, 7, 210, 2205, 12208, 47845, 148638, 393617, 922600, 1970325, 3902360, 7270725, 12868128, 21811881, 35617708, 56319375, 86565808, 129780448, 190285326, 273509446, 386137220, 536375658, 734131552, 991339307, 1322171256, 1743437850, 2274824006, 2939374683
Offset: 0

Views

Author

Colin Barker, Mar 21 2015

Keywords

Examples

			For n=2 there are 15 partitions of 7*2 = 14, so a(2) = 15*14 = 210.
		

Crossrefs

Programs

  • Mathematica
    Plus @@ Total /@ IntegerPartitions[7 #, {7}] & /@ Range[0, 24] (* Michael De Vlieger, Mar 21 2015 *)
  • PARI
    concat(0, vector(35, n, k=0; forpart(p=7*n, k++, , [7,7]); 7*n*k))

Formula

a(n) = 7*n*A256287(n).
Showing 1-1 of 1 results.