login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A357123
Number of sets S of size A066063(n) such that {1, 2, ..., n} is a subset of S + S.
1
1, 1, 2, 2, 5, 5, 2, 1, 11, 8, 1, 1, 26, 16, 2, 1, 65, 39, 7, 5, 284, 183, 52, 31, 8, 3, 422, 243, 58, 31, 4, 2, 893, 475, 144, 79, 21, 11, 1, 1, 428, 233, 54, 29, 3, 2, 2034, 1180, 371, 213
OFFSET
1,3
COMMENTS
A066063(n) is the size of the smallest set S such that S+S contains {1,2,...,n}.
EXAMPLE
For n=3 we can generate {1, 2, 3} with S = {0, 1, 2} and S = {0, 1, 3}.
CROSSREFS
Cf. A066063.
Sequence in context: A210713 A283825 A005177 * A253600 A373203 A045537
KEYWORD
nonn,more
AUTHOR
William Chang, Sep 12 2022
EXTENSIONS
a(31)-a(50) from Giovanni Resta, Oct 15 2022
STATUS
approved