|
|
A334733
|
|
a(n) is the sum of all parts of all partitions of n into consecutive parts that differ by 5.
|
|
5
|
|
|
1, 2, 3, 4, 5, 6, 14, 8, 18, 10, 22, 12, 26, 14, 30, 16, 34, 36, 38, 20, 63, 22, 46, 48, 50, 26, 81, 28, 58, 60, 62, 32, 99, 68, 70, 72, 74, 76, 117, 40, 82, 126, 86, 44, 135, 92, 94, 96, 98, 100, 153, 52, 106, 162, 165, 56, 171, 116, 118, 180, 122, 124, 189, 64, 195, 198, 134, 68, 207, 210
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
The one-part partition n = n is included in the count.
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
For n = 27 there are three partitions of 27 into consecutive parts that differ by 5, including 27 as a valid partition. They are [27], [16, 11] and [14, 9, 4]. The sum of all parts is [27] + [16 + 11] + [14 + 9 + 4] = 81, so a(27) = 81.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|