|
|
A002220
|
|
a(n) is the number of partitions of 3n that can be obtained by adding together three (not necessarily distinct) partitions of n.
(Formerly M3395 N1374)
|
|
5
|
|
|
1, 4, 10, 30, 65, 173, 343, 778, 1518, 3088, 5609, 10959, 18990, 34441, 58903, 102044, 167499, 282519, 451529, 737208, 1160102, 1836910, 2828466, 4410990, 6670202, 10161240, 15186315, 22758131, 33480869
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
REFERENCES
|
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
|
|
EXAMPLE
|
The a(1) = 1 through a(3) = 10 triquanimous partitions:
(111) (222) (333)
(2211) (3321)
(21111) (32211)
(111111) (33111)
(222111)
(321111)
(2211111)
(3111111)
(21111111)
(111111111)
(End)
|
|
CROSSREFS
|
The Heinz numbers of these partitions are given by A371955.
A371783 counts k-quanimous partitions.
|
|
KEYWORD
|
nonn,changed
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|