|
| |
| |
|
|
|
1, 0, 1, 8, 81, 1024, 15625, 279936, 5764801, 134217728, 3486784401, 100000000000, 3138428376721, 106993205379072, 3937376385699289, 155568095557812224, 6568408355712890625, 295147905179352825856
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,4
|
|
|
COMMENTS
| a(n) is the number of functions from {1,2,...,n} into {1,2,...,n} that have no fixed points.
|
|
|
LINKS
| Harry J. Smith, Table of n, a(n) for n = 0..100
|
|
|
FORMULA
| E.g.f.: x/(T(x)*(1-T(x))) (where T(x) is Euler's tree function, the E.g.f. for n^(n-1)) (see A000169).
|
|
|
MAPLE
| with(finance):seq(futurevalue(1, n-2, n), n=0..17); # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Mar 25 2009]
a:=n->mul(n, k=0..n): seq(a(n), n=-1..16); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Apr 09 2008
|
|
|
MATHEMATICA
| f[n_]:=(n-1)^n; lst={}; Do[AppendTo[lst, f[n]], {n, 0, 4!, 1}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Oct 04 2009]
|
|
|
PROG
| (PARI) { for (n=0, 100, write("b065440.txt", n, " ", (n - 1)^n) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Oct 19 2009]
|
|
|
CROSSREFS
| Essentially the same as A007778 - note T(x) = -W(-x))
Sequence in context: A055996 A068617 A007778 * A092366 A022519 A138439
Adjacent sequences: A065437 A065438 A065439 * A065441 A065442 A065443
|
|
|
KEYWORD
| nonn,easy,changed
|
|
|
AUTHOR
| Len Smiley (smiley(AT)math.uaa.alaska.edu), Nov 17 2001
|
| |
|
|
