|
|
A110149
|
|
a(0) = 1, a(1) = 3; for n>1, a(n) = n*a(n-1) + (-1)^n.
|
|
2
|
|
|
1, 3, 7, 20, 81, 404, 2425, 16974, 135793, 1222136, 12221361, 134434970, 1613219641, 20971855332, 293605974649, 4404089619734, 70465433915745, 1197912376567664, 21562422778217953, 409686032786141106, 8193720655722822121, 172068133770179264540
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
a(n) = (n-1)*(a(n-1)+a(n-2)), n>2. - Gary Detlefs, Apr 11 2010
|
|
LINKS
|
|
|
FORMULA
|
a(n) = 3*n! + floor((n!+1)/e) for n>0. - Gary Detlefs, Apr 11 2010
|
|
MAPLE
|
a:= proc(n) option remember;
`if`(n<2, 2*n+1, n*a(n-1)+(-1)^n)
end:
|
|
MATHEMATICA
|
RecurrenceTable[{a[1]==3, a[n]==n a[n-1]+(-1)^n}, a, {n, 20}] (* Harvey P. Dale, Nov 21 2011 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|