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!)
A297023 The number of distinct solutions of the maximum size in A072842 (i.e. size = A072842(n)) 1
1, 1, 3, 29931 (list; graph; refs; listen; history; text; internal format)
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
Cf. A072842.
Sequence in context: A225835 A007350 A003839 * A175875 A030463 A086509
KEYWORD
nonn,more,hard
AUTHOR
Jud McCranie, Dec 23 2017
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 April 19 17:39 EDT 2024. Contains 371797 sequences. (Running on oeis4.)