OFFSET
0,4
COMMENTS
b(n) = n^n mod (n+1)^(n-1) begins: 0, 0, 1, 11, 6, 533, 13042, 37111, 2428309, ... - Alex Ratushnyak, Aug 06 2012
a(n) is the number of functions f:{1,2,...,n}->{1,2,...,n} with at least one cycle of length >= 2. - Geoffrey Critzer, Jan 11 2013
Number of defective parking functions of length n and at least one defect. - Alois P. Heinz, Aug 18 2017
LINKS
Alois P. Heinz, Table of n, a(n) for n = 0..386
Peter J. Cameron, Daniel Johannsen, Thomas Prellberg, and Pascal Schweitzer, Counting Defective Parking Functions, arXiv:0803.0302 [math.CO], 2008.
FORMULA
E.g.f.: 1/(1-T(x)) - exp(T(x)) where T(x) is the e.g.f. for A000169. - Geoffrey Critzer, Jan 11 2013
a(n) = Sum_{k>0} A264902(n,k). - Alois P. Heinz, Nov 29 2015
EXAMPLE
a(3) = 3^3 - 4^2 = 27-16 = 11.
MATHEMATICA
ReplacePart[Table[n^n-(n+1)^(n-1), {n, 0, nn}], 0, 1] (* Geoffrey Critzer, Jan 11 2013 *)
PROG
(PARI) for(x=1, 20, print( x^x-(x+1)^(x-1) ))
(Python)
print([n**n - (n+1)**(n-1) for n in range(33)]) # Alex Ratushnyak, Aug 06 2012
CROSSREFS
KEYWORD
nonn
AUTHOR
Jorge Coveiro, Dec 24 2004
EXTENSIONS
a(0) prepended by Alex Ratushnyak, Aug 06 2012
STATUS
approved