|
Search: id:A086675
|
|
|
| A086675 |
|
Number of n X n (0,1)-matrices modulo cyclic permutations of the rows. |
|
+0
2
|
|
| 2, 10, 176, 16456, 6710912, 11453291200, 80421421917440, 2305843009750581376, 268650182136584290872320, 126765060022823052739661424640, 241677817415439249618874010960064512
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
FORMULA
|
a(n) = (1/n)*Sum_{ d divides n } phi(d)*2^(n^2/d).
|
|
MATHEMATICA
|
Table[Fold[ #1+EulerPhi[ #2] 2^(n^2 /#2)&, 0, Divisors[n]]/n, {n, 16}]
|
|
CROSSREFS
|
Cf. A000031, A060690.
Sequence in context: A132341 A069994 A063573 this_sequence A057119 A037267 A001528
Adjacent sequences: A086672 A086673 A086674 this_sequence A086676 A086677 A086678
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Yuval Dekel (dekelyuval(AT)hotmail.com), Jul 27 2003
|
|
EXTENSIONS
|
More terms from Wouter Meeussen (wouter.meeussen(AT)pandora.be), Jul 29 2003
|
|
|
Search completed in 0.002 seconds
|
