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!)
A346066 Sum of GCD of cycle lengths over all permutations of [n]. 2
0, 1, 3, 10, 45, 216, 1505, 9360, 84105, 730240, 7715169, 76204800, 1090114025, 11975040000, 185501455425, 2791872219136, 45361870178625, 690452066304000, 14415096609538625, 236887827111936000, 5448878874163974249, 108418310412206080000, 2381309423564793710625 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
Wikipedia, Permutation
FORMULA
a(n) = Sum_{k=1..n} k * A346085(n,k).
EXAMPLE
a(3) = 10 = 3+3+1+1+1+1: (123), (132), (1)(23), (13)(2), (12)(3), (1)(2)(3).
MAPLE
b:= proc(n, g) option remember; `if`(n=0, g, add((j-1)!
*b(n-j, igcd(g, j))*binomial(n-1, j-1), j=1..n))
end:
a:= n-> b(n, 0):
seq(a(n), n=0..24);
MATHEMATICA
b[n_, g_] := b[n, g] = If[n == 0, g, Sum[(j - 1)!*
b[n - j, GCD[g, j]]*Binomial[n - 1, j - 1], {j, 1, n}]];
a[n_] := b[n, 0];
Table[a[n], {n, 0, 24}] (* Jean-François Alcover, Mar 06 2022, after Alois P. Heinz *)
CROSSREFS
Cf. A060014 (the same for LCM), A346085.
Sequence in context: A102911 A096752 A293554 * A211193 A134018 A355719
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Jul 03 2021
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 9 08:29 EDT 2024. Contains 372346 sequences. (Running on oeis4.)