Svoboda | Graniru | BBC Russia | Golosameriki | Facebook
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!)

Revision History for A326033

(Underlined text is an addition; strikethrough text is a deletion.)

Showing all changes.
A326033 Number of knapsack partitions of n such that no addition of one part equal to an existing part is knapsack.
(history; published version)
#7 by Susanna Cuyler at Tue Jun 04 08:37:03 EDT 2019
STATUS

proposed

approved

#6 by Gus Wiseman at Mon Jun 03 23:47:17 EDT 2019
STATUS

editing

proposed

#5 by Gus Wiseman at Mon Jun 03 23:45:44 EDT 2019
MATHEMATICA

ks[n_]:=Select[IntegerPartitions[n], Length[sums[Sort[#]]]==Times@@(Length/@Split[#]+1)-1&];

maxks[n_]:=Select[ksIntegerPartitions[n], ksQ[#]&&Select[Table[Sort[Append[#, i]], {i, Union[#]}], ksQ]=={}&];

#4 by Gus Wiseman at Mon Jun 03 23:42:49 EDT 2019
EXAMPLE

The partition (10,8,6,6) is counted under a(30).) because (10,10,8,6,6), (10,8,8,6,6), and (10,8,6,6,6) are not knapsack.

#3 by Gus Wiseman at Mon Jun 03 05:49:00 EDT 2019
NAME

allocatedNumber of knapsack partitions of n such that no addition of one part equal to an existing forpart Gusis Wisemanknapsack.

DATA

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 2, 0, 0, 1, 1, 0, 3, 0, 0, 1, 1, 0, 8, 0, 8, 4, 3, 0, 11, 5, 3, 4, 5, 0, 30, 2, 9, 9, 20, 3, 37, 6, 18, 16, 37, 20, 71, 12, 37, 40

OFFSET

1,21

COMMENTS

An integer partition is knapsack if every distinct submultiset has a different sum.

EXAMPLE

The partition (10,8,6,6) is counted under a(30).

MATHEMATICA

sums[ptn_]:=sums[ptn]=If[Length[ptn]==1, ptn, Union@@(Join[sums[#], sums[#]+Total[ptn]-Total[#]]&/@Union[Table[Delete[ptn, i], {i, Length[ptn]}]])];

ks[n_]:=Select[IntegerPartitions[n], Length[sums[Sort[#]]]==Times@@(Length/@Split[#]+1)-1&];

ksQ[y_]:=Length[sums[Sort[y]]]==Times@@(Length/@Split[Sort[y]]+1)-1;

maxks[n_]:=Select[ks[n], Select[Table[Sort[Append[#, i]], {i, Union[#]}], ksQ]=={}&];

Table[Length[maxks[n]], {n, 30}]

CROSSREFS

Cf. A002033, A108917, A275972, A276024, A299702.

Cf. A325857, A325862, A325863, A325864, A325865, A326015, A326016, A326018.

KEYWORD

allocated

nonn,more

AUTHOR

Gus Wiseman, Jun 03 2019

STATUS

approved

editing

#2 by Gus Wiseman at Mon Jun 03 05:23:40 EDT 2019
KEYWORD

allocating

allocated

#1 by Gus Wiseman at Mon Jun 03 05:23:40 EDT 2019
NAME

allocated for Gus Wiseman

KEYWORD

allocating

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 August 22 04:48 EDT 2024. Contains 375356 sequences. (Running on oeis4.)