login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A362820 Number of ordered pairs of derangements on [n] that commute. 2
1, 0, 1, 4, 33, 136, 1825, 10956, 163009, 1575568, 23894721, 280090900, 5410068961, 73066199064, 1483125027553, 25872759745756, 561027082980225, 10796395534986016, 266457543316023169, 5743345672152317988, 152031229968147150241, 3717043193920429157800, 104377807879737865769121 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
COMMENTS
A derangement is a permutation without fixed points. Two permutations x,y commute if x*y = y*x.
LINKS
FORMULA
E.g.f.: (1 - x)^2 * exp(x) * B(x) where B(x) is the e.g.f. of A053529.
PROG
(PARI) seq(n)=Vec(serlaplace((1 - x)^2*exp(sum(k=1, n, (x^k/k)/(1-x^k) + O(x*x^n)) + x)))
CROSSREFS
A053529 is the corresponding sequence for all permutations.
Sequence in context: A027169 A152041 A041027 * A364946 A209034 A095671
KEYWORD
nonn
AUTHOR
Andrew Howroyd, May 05 2023
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 13 01:42 EDT 2024. Contains 374259 sequences. (Running on oeis4.)