Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A086501
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A086501 Number of non-commuting permutations: number of ordered pairs g, h in Symm(n) such that gh <> hg, i.e. the subgroup <g,h> is non-abelian. +0
1
0, 0, 18, 456, 13560, 510480, 25326000, 1624815360, 131671008000, 13168037030400, 1593348686899200, 229442495919436800, 38775787414703539200, 7600054444782928128000, 1710012252494048735232000 (list; graph; listen)
OFFSET

1,3

FORMULA

a(n) = n!^2 - A053529(n) = n! * ( n! - p(n) ) where p(n) is the number of partitions of n (A000041).

CROSSREFS

Cf. A053529, A000041.

Sequence in context: A111454 A116421 A005477 this_sequence A053115 A084273 A027405

Adjacent sequences: A086498 A086499 A086500 this_sequence A086502 A086503 A086504

KEYWORD

nonn

AUTHOR

Yuval Dekel (dekelyuval(AT)hotmail.com), Sep 09 2003

EXTENSIONS

More terms from Ray Chandler (rayjchandler(AT)sbcglobal.net), Sep 17 2003

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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research