

A306094


Number of plane partitions of n where parts are colored in (at most) 4 colors.


6



1, 4, 36, 228, 1540, 8964, 56292, 316388, 1857028, 10301892, 57884132, 312915172, 1720407492, 9132560068, 48898964964, 256790538660, 1350883911620, 6992031608260, 36296271612324, 185785685287076, 952221494828996, 4831039856692356, 24489621255994276
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,2


COMMENTS

a(0) = 1 corresponds to the empty sum, in which all terms are colored in one among four given colors, since there is no term at all.


LINKS



FORMULA

a(n) = Sum_{k=1..n} A091298(n,k)*4^k.


EXAMPLE

For n = 1, there is only the partition [1], which can be colored in any of the four colors, whence a(1) = 4.
For n = 2, there are the partitions [2], [1,1] and [1;1]. Adding colors, this yields a(2) = 4 + 16 + 16 = 36 distinct possibilities.


PROG

(PARI) a(n)=!n+sum(k=1, n, A091298(n, k)*4^k)


CROSSREFS



KEYWORD

nonn


AUTHOR



EXTENSIONS



STATUS

approved



