login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A107753 Number of primitive subsets of the n-th roots of unity summing to zero. 1
1, 2, 2, 3, 2, 6, 2, 5, 4, 8, 2, 11, 2, 10, 9, 9, 2, 16, 2, 15, 11, 14, 2, 21, 6, 16, 10, 19, 2, 212, 2, 17, 15, 20, 13, 31, 2, 22, 17, 29, 2 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

A primitive subset has no nonempty proper subset whose members sum to zero. Note that a(30) is the first term for which the formulas do not apply. For n=30, there are 1,0,15,10,0,5,30,60,60,30 primitive subsets of size 0,1,2,...,9.

FORMULA

For primes p and q, if n = p^i, then a(n)=1+n/p; if n=p^i q^j, then a(n)=1+n/p+n/q.

CROSSREFS

Cf. A103314 (number of subsets of the n-th roots of unity summing to zero), A107754 (number of subsets of the n-th roots of unity summing to one).

Sequence in context: A015995 A068903 A108499 * A197929 A078224 A159688

Adjacent sequences:  A107750 A107751 A107752 * A107754 A107755 A107756

KEYWORD

nonn

AUTHOR

T. D. Noe (noe(AT)sspectra.com), May 23 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 02:31 EST 2012. Contains 205978 sequences.