[math-fun] Sequence meeting

Looks like a fun weekend ahead! http://dimacs.rutgers.edu/Workshops/OEIS/abstracts.html A missing talk: How to look hard for sequence combinations? Neil must have addressed this in Superseeker, but I haven't seen any writeup. Suppose I have generated a new sequence M(n), and it's not in OEIS. Maybe it's some combination of OEIS sequences. What's a good way to proceed? I can look for M(n) = A(n) + B(n) reasonably efficiently (assuming I have a local copy), but trying A+B+C etc. rapidly outruns available computing resources. Also, automatically rejecting false positives looks hard. This seems like a natural area for research. Rich