Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A074752
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A074752 Number of combinatorially inequivalent cyclic subgroups of S_n of order 6. Partitions of n of order 6. +0
2
1, 2, 3, 5, 7, 9, 12, 16, 19, 24, 29, 34, 40, 48, 54, 63, 72, 81, 91, 104, 114, 128, 142, 156, 171, 190, 205, 225, 245, 265, 286, 312, 333, 360, 387, 414, 442, 476, 504, 539, 574, 609, 645, 688, 724, 768, 812, 856, 901, 954, 999, 1053, 1107, 1161, 1216, 1280 (list; graph; listen)
OFFSET

5,2

COMMENT

Two permutation groups are combinatorially equivalent iff they have the same cycle index. Order of partition is lcm of its parts.

FORMULA

G.f.: x^5*(1+x-x^6)/((x-1)*(x^2-1)*(x^3-1)*(x^6-1)). More generally, g.f. for number of partitions of order d is Sum_{i divides d} mu(d/i)*1/Product_{j divides i} (1-x^j).

CROSSREFS

Sequence in context: A062441 A059290 A133231 this_sequence A039825 A126256 A062438

Adjacent sequences: A074749 A074750 A074751 this_sequence A074753 A074754 A074755

KEYWORD

easy,nonn

AUTHOR

Vladeta Jovovic (vladeta(AT)eunet.rs), Sep 28 2002

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research