|
|
A101334
|
|
a(n) = n^n - (n+1)^(n-1).
|
|
5
|
|
|
0, 0, 1, 11, 131, 1829, 29849, 561399, 11994247, 287420489, 7642052309, 223394306387, 7123940054219, 246181194216957, 9165811757198641, 365836296342931439, 15584321022199735823, 705800730789742512401, 33866021217511735389485, 1716275655660313589123979
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
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
|
|
|
FORMULA
|
|
|
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
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|