The OEIS is looking to hire part-time people to help edit core sequences, upload scanned documents, process citations, fix broken links, etc. - Neil Sloane, njasloane@gmail.com
0,5
Table of n, a(n) for n=0..70.
Zhicheng Gao, Andrew MacFie and Daniel Panario, Counting words by number of occurrences of some patterns, The Electronic Journal of Combinatorics, 18 (2011), #p143.
G.f.: 1 / prod(k>=3, 1 - z^binomial(k, 3) );
a(10)=4 because we can write 10 = 10 = 4 + 4 + 1 + 1 = 4 + 1 + 1 + 1 + 1 + 1 = 1 + ... + 1.
See also A007294 (partitions into triangular numbers), A000292 (tetrahedral numbers).
Cf. A226748, A003108.
Sequence in context: A071903 A091372 A185322 * A280950 A279135 A053266
Adjacent sequences: A068977 A068978 A068979 * A068981 A068982 A068983
easy,nonn
Franklin T. Adams-Watters, Apr 01 2002
approved