[seqfan] Re: A083207 On an observation of Frank Buss.

[Donald Alan Morrison]

> Ok, just my two pence for the sake of brainstorming.
> [...]

I misspoke, the SubSet Sum (Partition Problem) is "weakly
NP-Complete", so that part can be attacked by dynamic programming (to
compute zk terms) slowly exponential in storage. I found a c
implementation...I'll see how far I can get before either storage
becomes a bottleneck, or my is_squarefree() check (upon intersection)
becomes a bottleneck....Place your bets(!)