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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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
Fausto A. C. Cariboni, Table of n, a(n) for n = 0..200
FORMULA
a(n) = A237194(2n,n).
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
The non-strict version is A002219, ranked by A357976.
These partitions are ranked by A357854.
A000712 counts distinct submultisets of partitions, strict A032302.
A304792 counts subset-sums of partitions, positive A276024, strict A284640.
Sequence in context: A169898 A281734 A086336 * A108796 A364684 A048849
KEYWORD
nonn
AUTHOR
Clark Kimberling, Feb 05 2014
EXTENSIONS
a(31)-a(47) from Alois P. Heinz, Feb 07 2014
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 5 22:09 EDT 2024. Contains 372290 sequences. (Running on oeis4.)