|
Search: id:A063776
|
|
|
| A063776 |
|
Number of subsets of {1,2,..n} which sum to 0 mod n. |
|
+0
9
|
|
| 2, 2, 4, 4, 8, 12, 20, 32, 60, 104, 188, 344, 632, 1172, 2192, 4096, 7712, 14572, 27596, 52432, 99880, 190652, 364724, 699072, 1342184, 2581112, 4971068, 9586984, 18512792, 35791472, 69273668, 134217728, 260301176, 505290272, 981706832
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..200
N. Kitchloo and L. Pachter, An interesting result about subset sums (pdf)
|
|
FORMULA
|
a(n) = 1/n * sum_{d divides n and d is odd} 2^(n/d) * phi(d).
|
|
MATHEMATICA
|
Table[a = Select[ Divisors[n], OddQ[ # ] &]; Apply[Plus, 2^(n/a)*EulerPhi[a]]/n, {n, 1, 35}]
|
|
CROSSREFS
|
Equals 2*A000016(n). The super-diagonal of A068009. Cf. also A000010, A000013, A051293, A053633. For odd n a(n) = A000031(n) (necklaces).
Cf. A053636, A054539, A082550.
Sequence in context: A022476 A000013 A064484 this_sequence A118406 A072488 A074818
Adjacent sequences: A063773 A063774 A063775 this_sequence A063777 A063778 A063779
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
Ahmed Fares (ahmedfares(AT)my-deja.com), Aug 16 2001
|
|
EXTENSIONS
|
More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Aug 20 2001
|
|
|
Search completed in 0.002 seconds
|
