[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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

Showing entries 1-10 | older changes
Number T(n,k) of permutations of [n] such that k is the GCD of the cycle lengths; triangle T(n,k), n>=0, 0<=k<=n, read by rows.
(history; published version)
#23 by Alois P. Heinz at Fri Mar 01 14:57:42 EST 2024
STATUS

editing

approved

#22 by Alois P. Heinz at Fri Mar 01 14:57:21 EST 2024
CROSSREFS
STATUS

approved

editing

#21 by Alois P. Heinz at Sun Jan 22 18:08:34 EST 2023
STATUS

editing

approved

#20 by Alois P. Heinz at Fri Jan 20 16:49:26 EST 2023
FORMULA

Sum_{prime p <= n} T(n,p) = A359951(n). - Alois P. Heinz, Jan 20 2023

CROSSREFS
STATUS

approved

editing

#19 by Alois P. Heinz at Mon Aug 30 12:12:36 EDT 2021
STATUS

proposed

approved

#18 by Jean-François Alcover at Mon Aug 30 12:02:53 EDT 2021
STATUS

editing

proposed

#17 by Jean-François Alcover at Mon Aug 30 12:02:44 EDT 2021
MATHEMATICA

b[n_, g_] := b[n, g] = If[n == 0, x^g, Sum[(j - 1)!*

b[n - j, GCD[g, j]] Binomial[n - 1, j - 1], {j, n}]];

T[n_] := CoefficientList[b[n, 0], x];

Table[T[n], {n, 0, 12}] // Flatten (* Jean-François Alcover, Aug 30 2021, after Alois P. Heinz *)

STATUS

approved

editing

#16 by Alois P. Heinz at Mon Jul 05 07:15:20 EDT 2021
STATUS

editing

approved

#15 by Alois P. Heinz at Mon Jul 05 07:15:16 EDT 2021
LINKS

Alois P. Heinz, <a href="/A346085/b346085.txt">Table of n, a(n) for Rows n = 0..10010140, flattened</a>

#14 by Alois P. Heinz at Mon Jul 05 07:14:54 EDT 2021
LINKS

Alois P. Heinz, <a href="/A346085/b346085.txt">Table of n, a(n) for n = 0..10010</a>