|
Search: id:A104404
|
|
|
| A104404 |
|
Number of groups of order n all of whose subgroups are normal. |
|
+0
5
|
|
| 1, 1, 1, 2, 1, 1, 1, 4, 2, 1, 1, 2, 1, 1, 1, 6, 1, 2, 1, 2, 1, 1, 1, 4, 2, 1, 3, 2, 1, 1, 1, 8, 1, 1, 1, 4, 1, 1, 1, 4, 1, 1, 1, 2, 2, 1, 1, 6, 2, 2, 1, 2, 1, 3, 1, 4, 1, 1, 1, 2, 1, 1, 2, 12, 1, 1, 1, 2, 1, 1, 1, 8, 1, 1, 2, 2, 1, 1, 1, 6, 5, 1, 1, 2, 1, 1, 1, 4, 1, 2, 1, 2, 1, 1, 1, 8, 1, 2, 2, 4, 1, 1
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
REFERENCES
|
R. D. Carmichael, Introduction to the Theory of Groups of Finite Order, New York, Dover, 1956.
J. C. Lennox, S.E. Stonehewer, Subnormal Subgroups of Groups, Oxford University Press, 1987.
|
|
LINKS
|
B. Horvat, G. Jaklic and T. Pisanski, On the number of Hamiltonian groups
Eric Weisstein's World of Mathematics, Abelian Group
Eric Weisstein's World of Mathematics, Hamiltonian Group
|
|
FORMULA
|
The number b(n) of all groups of order n all of whose subgroups are normal is given as b(n)=a(n)+h(n), where a(n) denotes the number of Abelian groups of order n and h(n) denotes the number of Hamiltonian groups of order n.
|
|
MATHEMATICA
|
orders[n_]:=Map[Last, FactorInteger[n]]; a[n_]:=Apply[Times, Map[PartitionsP, orders[n]]]; e[n_]:=n/ 2^IntegerExponent[n, 2]; h[n_]/; Mod[n, 8]==0:=a[e[n]]; h[n_]:=0; b[n_]:= a[n]+h[n];
|
|
CROSSREFS
|
Cf. A000688, A000001.
Sequence in context: A112331 A133910 A066441 this_sequence A162512 A162510 A131505
Adjacent sequences: A104401 A104402 A104403 this_sequence A104405 A104406 A104407
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Boris Horvat (Boris.Horvat(AT)fmf.uni-lj.si), Gasper Jaklic (Gasper.Jaklic(AT)fmf.uni-lj.si), Tomaz Pisanski (Tomaz.Pisanski(AT)fmf.uni-lj.si), Apr 19 2005
|
|
|
Search completed in 0.002 seconds
|
