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!)
A350134 Number of endofunctions on [n] with at least one isolated fixed point. 4
0, 1, 1, 10, 87, 1046, 15395, 269060, 5440463, 124902874, 3208994379, 91208536112, 2841279322871, 96258245162678, 3523457725743059, 138573785311560916, 5827414570508386335, 260928229315498155314, 12393729720071855683739, 622422708333615857463608 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
LINKS
FORMULA
a(n) = A000312(n) - abs(A069856(n)).
a(n) = Sum_{k=1..n} A350212(n,k).
EXAMPLE
a(3) = 10: 123, 122, 133, 132, 121, 323, 321, 113, 223, 213.
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 *)
CROSSREFS
Column k=1 of A347999.
Sequence in context: A121115 A292998 A114648 * A217417 A136864 A099789
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Dec 15 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 21 15:23 EDT 2024. Contains 372738 sequences. (Running on oeis4.)