|
|
A237258
|
|
Number of strict partitions of 2n that include a partition of n.
|
|
40
|
|
|
1, 0, 0, 1, 1, 3, 4, 7, 9, 16, 21, 32, 43, 63, 84, 122, 158, 220, 293, 393, 511, 685, 881, 1156, 1485, 1925, 2445, 3147, 3952, 5019, 6323, 7924, 9862, 12336, 15259, 18900, 23294, 28646, 35091, 42985, 52341, 63694, 77336, 93588, 112973, 136367, 163874, 196638
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,6
|
|
COMMENTS
|
A strict partition is a partition into distinct parts.
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
a(5) counts these partitions of 10: [5,4,1], [5,3,2], [4,3,2,1].
|
|
MATHEMATICA
|
z = 24; Table[theTotals = Map[{#, Map[Total, Subsets[#]]} &, Select[IntegerPartitions[2 nn], # == DeleteDuplicates[#] &]]; Length[Map[#[[1]] &, Select[theTotals, Length[Position[#[[2]], nn]] >= 1 &]]], {nn, z}] (* Peter J. C. Moses, Feb 04 2014 *)
|
|
CROSSREFS
|
These partitions are ranked by A357854.
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|