\\ Number of maximal subsets of {1..n} containing no sums of distinct elements. \\ Main recursive function has the following arguments: \\ k: Indicates elements from 1..k have been picked. \\ b: bitmap of chosen elements. \\ es: bitmap of sums of distinct elements of b. A326498(n)={ \\ test for maximality my(ismaxl(b, es)= for(k=1, n, if(!bittest(es,k) && !bitand(es, b>>k), return(0))); 1 ); \\ main recursion my(recurse(k, b, es)= k++; if(k > n, ismaxl(b, es), self()(k, b, es) + if(!bittest(es,k), self()(k, b + (1<