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.

Showing 1-2 of 2 results.

A290932 Sum of the LCM of cycle lengths over all endofunctions on [n].

Original entry on oeis.org

1, 1, 5, 40, 431, 5886, 96817, 1862890, 41043375, 1018584610, 28108489541, 853617865134, 28287119604955, 1015630741097350, 39273014068691145, 1627118268024495586, 71904849762914854703, 3375959341815207350850, 167810405947367539063885, 8803814897608815310714270
Offset: 0

Views

Author

Alois P. Heinz, Aug 13 2017

Keywords

Crossrefs

Programs

  • Maple
    b:= proc(n, m) option remember; `if`(n=0, m, add((j-1)!*
          b(n-j, ilcm(m, j))*binomial(n-1, j-1), j=1..n))
        end:
    a:= n-> add(b(j, 1)*n^(n-j)*binomial(n-1, j-1), j=0..n):
    seq(a(n), n=0..25);
  • Mathematica
    T[n_, k_] := T[n, k] = If[n == 0, k, Sum[(j - 1)! * T[n - j, LCM[k, j]]*Binomial[n - 1, j - 1], {j, n}]]; {1}~Join~Table[Sum[T[j, 1]*n^(n - j)*Binomial[n - 1, j - 1], {j, 0, n}], {n, 19}] (* Michael De Vlieger, Aug 17 2017 *)

Formula

a(n) = Sum_{k=1..A000793(n)} k * A222029(n,k).

A208231 Sum of the minimum cycle length over all functions f:{1,2,...,n}->{1,2,...,n} (endofunctions).

Original entry on oeis.org

0, 1, 5, 37, 373, 4761, 73601, 1336609, 27888281, 657386305, 17276807089, 500876786301, 15879053677697, 546470462226313, 20288935994319929, 808320431258439121, 34397370632215764001, 1557106493482564625793, 74713970491718324746529, 3787792171563440619543133, 202314171910557294992453009
Offset: 0

Views

Author

Geoffrey Critzer, Jan 10 2013

Keywords

Comments

Sum of the number of endofunctions whose cycle lengths are >=i for all i >=1. A000312 + A065440 + A134362 + A208230 + ...

Crossrefs

Programs

  • Maple
    b:= proc(n, m) option remember; `if`(n=0, m, add((j-1)!*
          b(n-j, min(m, j))*binomial(n-1, j-1), j=1..n))
        end:
    a:= n-> add(b(j$2)*n^(n-j)*binomial(n-1, j-1), j=0..n):
    seq(a(n), n=0..25);  # Alois P. Heinz, May 20 2016
  • Mathematica
    nn=20;t=Sum[n^(n-1)x^n/n!,{n,1,nn}];Apply[Plus,Table[Range[0,nn]!CoefficientList[Series[Exp[Sum[t^i/i,{i,n,nn}]]-1,{x,0,nn}],x],{n,1,nn}]]

Formula

E.g.f.: A(T(x)) = Sum_{k>=1} exp( Sum_{i>=k} T(x)^i/i) - 1 where A(x) is the e.g.f. for A028417 and T(x) is the e.g.f. for A000169.
Showing 1-2 of 2 results.