cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A055555 a(n) = n!*(n!+1)/2.

Original entry on oeis.org

1, 1, 3, 21, 300, 7260, 259560, 12703320, 812871360, 65841128640, 6584096534400, 796675481078400, 114721266640780800, 19387894024929830400, 3800027228319587865600, 855006126362753549184000, 218881568348707987666944000, 63256773252773762936322048000
Offset: 0

Views

Author

N. J. A. Sloane, Jul 19 2000

Keywords

Comments

a(n) is the number of unordered pairs (not necessarily distinct) of elements in S_n (the symmetric group on n letters). That is, a(n) = binomial(n!,2) + n!. - Geoffrey Critzer, Jan 09 2016

Crossrefs

Programs

Formula

a(n) + (-n^2-n-3)*a(n-1) + (n-1)*(n^2+2*n-1)*a(n-2) - 2*(n-1)*(n-2)^2*a(n-3) = 0. - R. J. Mathar, Mar 21 2013
a(n) = Sum_{k=1..n!} k. - Pedro Caceres, Mar 10 2018
a(n) = A000217(A000142(n)). - Michel Marcus, Mar 11 2018