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-4 of 4 results.

A069856 E.g.f.: exp(x)/(1+LambertW(x)).

Original entry on oeis.org

1, 0, 3, -17, 169, -2079, 31261, -554483, 11336753, -262517615, 6791005621, -194103134499, 6074821125385, -206616861429575, 7588549099814957, -299320105069298459, 12619329503201165281, -566312032570838608863, 26952678355224681891685
Offset: 0

Views

Author

Joe Keane (jgk(AT)jgk.org), May 03 2002

Keywords

Comments

Inverse binomial transform of A000312. - Tilman Neumann, Dec 13 2008
The |a(n)| is the number of functions f:{1,2,...,n}->{1,2,...,n} such that the digraph representation of f has no isolated vertices. - Geoffrey Critzer, Nov 13 2011

References

  • sci.math article 3CBC2B66.224E(AT)olympus.mons

Crossrefs

Cf. A086331.
Cf. A350212.

Programs

  • Mathematica
    t = Sum[n^(n - 1) x^n/n!, {n, 1, 20}]; Range[0, 20]! CoefficientList[Series[Exp[-x]/(1 - t), {x, 0, 20}], x] (* Geoffrey Critzer, Nov 13 2011 *)
    Range[0, 18]! CoefficientList[ Series[ Exp[x]/(1 + LambertW[x]), {x, 0, 18}], x] (* Robert G. Wilson v, Nov 28 2012 *)
  • PARI
    my(x='x+O('x^20)); Vec(serlaplace(exp(x)/(1+lambertw(x)))) \\ G. C. Greubel, Jun 11 2017

Formula

a(n) = n! * Sum_{k=0..n} (-1)^k*k^k/(k!*(n - k)!).
E.g.f. for absolute value of {a(n)}: exp(C(x)-x) where C(x) is the e.g.f for A001865. - Geoffrey Critzer, Nov 13 2011, corrected by Vaclav Kotesovec, Nov 27 2012
abs(a(n)) ~ (exp(1)*n-1/2)/exp(1+exp(-1)) * n^(n-1). - Vaclav Kotesovec, Nov 27 2012
a(n) = (-1)^n * A350212(n,0). - Alois P. Heinz, Dec 19 2021

A349454 Number T(n,k) of endofunctions on [n] with exactly k fixed points, all of which are isolated; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

Original entry on oeis.org

1, 0, 1, 1, 0, 1, 8, 3, 0, 1, 81, 32, 6, 0, 1, 1024, 405, 80, 10, 0, 1, 15625, 6144, 1215, 160, 15, 0, 1, 279936, 109375, 21504, 2835, 280, 21, 0, 1, 5764801, 2239488, 437500, 57344, 5670, 448, 28, 0, 1, 134217728, 51883209, 10077696, 1312500, 129024, 10206, 672, 36, 0, 1
Offset: 0

Views

Author

Alois P. Heinz, Dec 30 2021

Keywords

Examples

			Triangle T(n,k) begins:
        1;
        0,       1;
        1,       0,      1;
        8,       3,      0,     1;
       81,      32,      6,     0,    1;
     1024,     405,     80,    10,    0,   1;
    15625,    6144,   1215,   160,   15,   0,  1;
   279936,  109375,  21504,  2835,  280,  21,  0, 1;
  5764801, 2239488, 437500, 57344, 5670, 448, 28, 0, 1;
  ...
		

Crossrefs

Column k=0 gives A065440.
Row sums give A204042.
Main diagonal and first lower diagonal give A000012, A000004.
T(n+1,n-1) gives A000217.
T(n+3,n) gives A130809.
T(n+3,n-1) gives A102741 for n>=1.

Programs

  • Maple
    T:= (n, k)-> binomial(n, k)*(n-k-1)^(n-k):
    seq(seq(T(n, k), k=0..n), n=0..10);

Formula

T(n,k) = binomial(n,k) * (n-k-1)^(n-k).
From Mélika Tebni, Apr 02 2023: (Start)
E.g.f. of column k: -x / (LambertW(-x)*(1+LambertW(-x)))*x^k / k!.
Sum_{k=0..n} k^k*T(n,k) = A217701(n). (End)

A350134 Number of endofunctions on [n] with at least one isolated fixed point.

Original entry on oeis.org

0, 1, 1, 10, 87, 1046, 15395, 269060, 5440463, 124902874, 3208994379, 91208536112, 2841279322871, 96258245162678, 3523457725743059, 138573785311560916, 5827414570508386335, 260928229315498155314, 12393729720071855683739, 622422708333615857463608
Offset: 0

Views

Author

Alois P. Heinz, Dec 15 2021

Keywords

Examples

			a(3) = 10: 123, 122, 133, 132, 121, 323, 321, 113, 223, 213.
		

Crossrefs

Programs

  • Maple
    g:= proc(n) option remember; add(n^(n-j)*(n-1)!/(n-j)!, j=1..n) end:
    b:= proc(n, t) option remember; `if`(n=0, t, add(g(i)*
          b(n-i, `if`(i=1, 1, t))*binomial(n-1, i-1), i=1..n))
        end:
    a:= n-> b(n, 0):
    seq(a(n), n=0..23);
  • Mathematica
    g[n_] := g[n] = Sum[n^(n - j)*(n - 1)!/(n - j)!, {j, 1, n}];
    b[n_, t_] := b[n, t] = If[n == 0, t, Sum[g[i]*
         b[n - i, If[i == 1, 1, t]]*Binomial[n - 1, i - 1], {i, 1, n}]];
    a[n_] := b[n, 0];
    Table[a[n], {n, 0, 23}] (* Jean-François Alcover, Apr 27 2022, after Alois P. Heinz *)

Formula

a(n) = A000312(n) - abs(A069856(n)).
a(n) = Sum_{k=1..n} A350212(n,k).

A348590 Number of endofunctions on [n] with exactly one isolated fixed point.

Original entry on oeis.org

0, 1, 0, 9, 68, 845, 12474, 218827, 4435864, 102030777, 2625176150, 74701061831, 2329237613988, 78972674630005, 2892636060014050, 113828236497224355, 4789121681108775344, 214528601554419809777, 10193616586275094959534, 512100888749268955942015
Offset: 0

Views

Author

Alois P. Heinz, Dec 20 2021

Keywords

Examples

			a(3) = 9: 122, 133, 132, 121, 323, 321, 113, 223, 213.
		

Crossrefs

Column k=1 of A350212.

Programs

  • Maple
    g:= proc(n) option remember; add(n^(n-j)*(n-1)!/(n-j)!, j=1..n) end:
    b:= proc(n, t) option remember; `if`(n=0, t, add(g(i)*
          b(n-i, `if`(i=1, 1, t))*binomial(n-1, i-1), i=1+t..n))
        end:
    a:= n-> b(n, 0):
    seq(a(n), n=0..23);
  • Mathematica
    g[n_] := g[n] = Sum[n^(n - j)*(n - 1)!/(n - j)!, {j, 1, n}] ;
    b[n_, t_] := b[n, t] = If[n == 0, t, Sum[g[i]*
         b[n - i, If[i == 1, 1, t]]*Binomial[n - 1, i - 1], {i, 1 + t, n}]];
    a[n_] := b[n, 0];
    Table[a[n], {n, 0, 23}] (* Jean-François Alcover, May 16 2022, after Alois P. Heinz *)

Formula

a(n) mod 2 = A000035(n).
Showing 1-4 of 4 results.