|
|
A305460
|
|
a(0) = 1, a(1) = 3, a(n) = 3*n*a(n-1) + 2*a(n-2).
|
|
3
|
|
|
1, 3, 20, 186, 2272, 34452, 624680, 13187184, 317741776, 8605402320, 258797553152, 8557530058656, 308588677217920, 12052073471616192, 506804263162315904, 22830295989247448064, 1096867816010202138880, 55985919208498803979008
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
Let S(i,j,n) denote a sequence of the form a(0) = 1, a(1) = i, a(n) = i*n*a(n-1) + j*a(n-2). Then S(i,j,n) = Sum_{k=0..floor(n/2)} ((n-k)!/k!)*binomial(n-k,k)*i^(n-2*k)*j^k.
|
|
LINKS
|
|
|
FORMULA
|
a(n) = Sum_{k=0..floor(n/2)} ((n-k)!/k!)*binomial(n-k,k)*3^(n-2*k)*2^k.
|
|
MAPLE
|
a:=proc(n) option remember: if n=0 then 1 elif n=1 then 3 elif n>=2 then 3*n*procname(n-1)+2*procname(n-2) fi; end:
|
|
PROG
|
(PARI) {a(n) = sum(k=0, n/2, ((n-k)!/k!)*binomial(n-k, k)*3^(n-2*k)*2^k)}
(GAP) List([0..20], n->Sum([0..Int(n/2)], k->((Factorial(n-k))/(Factorial(k))*Binomial(n-k, k)*3^(n-2*k)*2^k))); # Muniru A Asiru, Jun 01 2018
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|