a(n) = the number of aperiodic subsets S of the n-th roots of 1 with zero sum (i.e. there is no r different from 1 such that r*S=S).
1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 24, 0, 6, 0, 0, 0, 236, 0, 0, 0, 18, 0, 3768, 0
1 seqfan posts
Sat May 2 16:12:32 CEST 2009 [seqfan] Re: OEIS duplicate hunt