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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A256288 Sum of all the parts in the partitions of 7n into 7 parts. 1
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS FORMULA a(n) = 7*n*A256287(n). EXAMPLE For n=2 there are 15 partitions of 7*2 = 14, so a(2) = 15*14 = 210. MATHEMATICA Plus @@ Total /@ IntegerPartitions[7 #, {7}] & /@ Range[0, 24] (* Michael De Vlieger, Mar 21 2015 *) PROG (PARI) concat(0, vector(35, n, k=0; forpart(p=7*n, k++, , [7, 7]); 7*n*k)) CROSSREFS Cf. A235988, A238328, A256235, A256287. Sequence in context: A275822 A065819 A241649 * A302107 A061028 A012862 Adjacent sequences: A256285 A256286 A256287 * A256289 A256290 A256291 KEYWORD nonn AUTHOR Colin Barker, Mar 21 2015 STATUS approved

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.

Last modified December 5 21:40 EST 2022. Contains 358594 sequences. (Running on oeis4.)