reviewed
approved
reviewed
approved
proposed
reviewed
editing
proposed
Number of subsets A of {1,...,n} such that there are no solutions to a+b+c=d for a,b,c,d in A.
In sumset notation, the sequence gives the number of subsets A of {1,...,n} such that the intersection of A and 3A is empty. Using the Mathematica program, all such subsets can be printed.
proposed
editing
editing
proposed
Fausto A. C. Cariboni, <a href="/A093970/b093970.txt">Table of n, a(n) for n = 0..62</a>
approved
editing
reviewed
approved
proposed
reviewed
editing
proposed
1, 2, 4, 6, 11, 21, 31, 55, 99, 145, 252, 430, 620, 1042, 1786, 2597, 4304, 7241, 10374, 17098, 28967, 41444, 68017, 113746, 162204, 268412, 449318, 640341, 1053604, 1764648, 2524852, 4154138, 6968215, 9935216, 16371249, 27594872, 39353636, 64914388, 109205201
a(21)-a(38) from Fausto A. C. Cariboni, Sep 30 2020
approved
editing