login

Revision History for A088994

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Number of permutations in the symmetric group S_n such that the size of their centralizer is odd.
(history; published version)
#47 by Michael De Vlieger at Tue Jan 09 08:50:30 EST 2024
STATUS

reviewed

approved

#46 by Joerg Arndt at Mon Jan 08 23:45:05 EST 2024
STATUS

proposed

reviewed

#45 by Alois P. Heinz at Mon Jan 08 15:16:33 EST 2024
STATUS

editing

proposed

#44 by Alois P. Heinz at Mon Jan 08 15:16:09 EST 2024
COMMENTS

Also the number of permutations p of [n] with unique (functional) square root, i.e., there exists a unique permutation g such that g^2 = fp. - Keith J. Bauer, Jan 08 2024

STATUS

proposed

editing

#43 by Keith J. Bauer at Mon Jan 08 15:01:06 EST 2024
STATUS

editing

proposed

#42 by Keith J. Bauer at Mon Jan 08 14:58:49 EST 2024
COMMENTS

Also the number of permutations with unique (functional) square root, i.e., there exists a unique permutation g such that g^2 = f. - Keith J. Bauer, Jan 08 2024

STATUS

approved

editing

#41 by Alois P. Heinz at Mon Jan 27 17:42:54 EST 2020
STATUS

editing

approved

#40 by Alois P. Heinz at Mon Jan 27 17:41:54 EST 2020
FORMULA

a(n) = n! - A088335(n). - _Alois P. Heinz_, Jan 27 2020

#39 by Alois P. Heinz at Mon Jan 27 17:40:54 EST 2020
FORMULA

a(n) = n! - A088335(n).

STATUS

approved

editing

#38 by Vaclav Kotesovec at Sat Jul 27 02:37:30 EDT 2019
STATUS

editing

approved