|
|
A297023
|
|
The number of distinct solutions of the maximum size in A072842 (i.e. size = A072842(n))
|
|
1
|
|
|
|
OFFSET
|
1,3
|
|
LINKS
|
|
|
EXAMPLE
|
There are three distinct ways to partition the numbers 1 to 23 into three sets such that no member of each partition is the sum of two other members. The solutions are (11212221331333313323212), (11212221331333331323212), (11212221331333333323212) where each digit is the partition to which k belongs.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more,hard
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|