OFFSET
1,3
REFERENCES
Miklos Bona, editor, Handbook of Enumerative Combinatorics, CRC Press, 2015, page 428, see b_n.
LINKS
Andrew Howroyd, Table of n, a(n) for n = 1..50
V. A. Liskovets, Some easily derivable sequences, J. Integer Sequences, 3 (2000), #00.2.2.
FORMULA
MAPLE
A054947 := proc(n)
option remember;
if n = 1 then
1;
else
2^(n*(n-1))-add(binomial(n, t)*2^((n-1)*(n-t))*procname(t), t=1..n-1) ;
end if;
end proc: # R. J. Mathar, May 10 2016
MATHEMATICA
a[1] = 1; a[n_] := a[n] = 2^(n(n-1)) - Sum[Binomial[n, j] 2^((n-1)(n-j)) a[j], {j, 1, n-1}];
Array[a, 13] (* Jean-François Alcover, Aug 27 2019 *)
PROG
(PARI) seq(n)={my(v=vector(n)); v[1]=1; for(n=2, #v, v[n]=2^(n*(n-1))-sum(j=1, n-1, binomial(n, j)*2^((n-1)*(n-j))*v[j])); v} \\ Andrew Howroyd, Sep 09 2018
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, May 24 2000
EXTENSIONS
More terms from Vladeta Jovovic, Mar 11 2003
STATUS
approved