The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A332851 Number of entries in the second cycles of all permutations of [n] when cycles are ordered by decreasing lengths. 3
1, 4, 21, 131, 950, 7694, 70343, 709015, 7867174, 94945874, 1241471451, 17442660795, 262748183438, 4215551220698, 71873188059263, 1296535610096063, 24690833276595022, 494624740502491786, 10406110949475668267, 229244825016301188267, 5280217980442316367510 (list; graph; refs; listen; history; text; internal format)
OFFSET
2,2
LINKS
Andrew V. Sills, Integer Partitions Probability Distributions, arXiv:1912.05306 [math.CO], 2019.
Wikipedia, Permutation
FORMULA
a(n) = Sum_{k=0..floor(n/2)} k * A349979(n,k). - Alois P. Heinz, Dec 07 2021
MAPLE
b:= proc(n, l) option remember; `if`(n=0, l[2], add((j-1)!*b(n-j,
sort([l[], j], `>`)[1..2])*binomial(n-1, j-1), j=1..n))
end:
a:= n-> b(n, [0$2]):
seq(a(n), n=2..23);
MATHEMATICA
b[n_, l_] := b[n, l] = If[n == 0, l[[2]], Sum[(j-1)! b[n-j, ReverseSort[ Append[l, j]][[1 ;; 2]]] Binomial[n - 1, j - 1], {j, 1, n}]];
a[n_] := b[n, {0, 0}];
a /@ Range[2, 23] (* Jean-François Alcover, Mar 01 2020, after Alois P. Heinz *)
CROSSREFS
Column k=2 of A322384.
Cf. A349979.
Sequence in context: A090366 A273956 A131965 * A303563 A284816 A226067
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Feb 26 2020
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 May 14 04:33 EDT 2024. Contains 372528 sequences. (Running on oeis4.)