|
Search: id:A038048
|
|
|
| A038048 |
|
a(n) = (n-1)! * sum {d|n} d. |
|
+0 11
|
|
| 1, 3, 8, 42, 144, 1440, 5760, 75600, 524160, 6531840, 43545600, 1117670400, 6706022400, 149448499200, 2092278988800, 40537905408000, 376610217984000, 13871809695744000, 128047474114560000, 5109094217170944000
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Or, a(n) = Sum_{ d divides n } n!/d. - Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jul 24 2005
Number of labeled regular octopi (or octopuses, cycles of ordered sets all the same size).
|
|
REFERENCES
|
F. Bergeron, G. Labelle and P. Leroux, Combinatorial Species and Tree-Like Structures, Camb. 1998, p. 56 (1.4.67).
L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 159, #10, A(n,1).
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..100
H. Ochiai, Counting functions for branched covers of elliptic curves and quasi-modular forms
|
|
FORMULA
|
a(p) = (p+1)*(p-1)! if p is a prime. - Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jul 24 2005
E.g.f.: log(f(x)), where f(x) = o.g.f. for partitions (A000041), Product_{k=1..inf} 1/(1-x^k) - N. J. A. Sloane (njas(AT)research.att.com).
E.g.f.: Sum_{k>0} x^k/(k*(1-x^k)). - Vladeta Jovovic (vladeta(AT)eunet.rs), Mar 27 2005
|
|
EXAMPLE
|
a(6) = 6!{1/1 +1/2 +1/3 + 1/6}=1440.
|
|
MAPLE
|
with(numtheory): a:=proc(n) local div: div:=divisors(n): n!*sum(1/div[j], j=1..tau(n)) end: seq(a(n), n=1..23); (Deutsch)
|
|
CROSSREFS
|
Left edge of triangle in A008298. Cf. A058892.
Cf. A057625.
Cf. A110373, A110374.
Sequence in context: A007175 A152394 A128322 this_sequence A051763 A074435 A039647
Adjacent sequences: A038045 A038046 A038047 this_sequence A038049 A038050 A038051
|
|
KEYWORD
|
easy,nonn,nice
|
|
AUTHOR
|
Christian G. Bower (bowerc(AT)usa.net)
|
|
EXTENSIONS
|
More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Jul 24 2005
Edited by N. J. A. Sloane (njas(AT)research.att.com), May 12 2008 at the suggestion of Joerg Arndt.
|
|
|
Search completed in 0.003 seconds
|