A226140 a(n) = Sum_{i=1..floor(n/2)} (n-i)^i.

0, 1, 2, 7, 13, 48, 95, 424, 898, 4837, 10780, 68399, 158111, 1156224, 2745145, 22744380, 55098660, 510307001, 1255610350, 12859037607, 32030878113, 359498491968, 904385401323, 11040700820704, 28000658588542

Offset

1,3

Comments

a(n) is the sum of the larger parts raised to the corresponding smaller parts of the partitions of n into exactly two parts.

Links

Michael De Vlieger, Table of n, a(n) for n = 1..773

Index entries for sequences related to partitions

Formula

a(n) = Sum_{i=1..floor(n/2)} (n-i)^i.

Example

a(6) = 48; 6 has exactly 3 partitions into two parts: (5,1),(4,2),(3,3). Raising the larger parts to their corresponding smaller parts and adding the results, we get: 5^1 + 4^2 + 3^3 = 5 + 16 + 27 = 48.

Maple

A226140:=n->sum((n-i)^i, i=1..n/2): seq(A226140(n), n=1..40);

Mathematica

Array[Sum[(# - i)^i, {i, Floor[#/2]}] &, 25] (* Michael De Vlieger, Jan 23 2018 *)

Prog

(PARI) a(n) = sum(k=1, n\2, (n-k)^k); \\ Michel Marcus, Dec 13 2015

Crossrefs

Cf. A226065.

Sequence in context: A178607 A321407 A127487 * A180003 A211874 A262830

Adjacent sequences: A226137 A226138 A226139 * A226141 A226142 A226143

Keyword

nonn,easy

Author

Wesley Ivan Hurt, May 27 2013

Status

approved