

A088528


Let m = number of ways of partitioning n into parts using all the parts of a subset of {1, 2, ..., n1} whose sum of all parts of a subset is less than n; a(n) gives number of different subsets of {1, 2, ..., n1} whose m is 0.


1



0, 0, 1, 1, 3, 3, 6, 6, 10, 12, 17, 18, 26, 30, 40, 44, 58, 66, 84, 95, 120, 135, 166, 186, 230, 257, 314, 350, 421, 476, 561, 626, 749, 831, 986, 1095, 1276, 1424, 1666, 1849, 2138, 2388, 2741, 3042, 3522, 3879, 4441, 4928, 5617, 6222, 7084, 7802, 8852, 9800
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,5


COMMENTS

Note that {2, 3} is counted for n = 6 because although 6 = 2+2+2 = 3+3, there is no partition that includes both 2 and 3.  David Wasserman, Aug 09 2005


LINKS

Table of n, a(n) for n=1..54.


EXAMPLE

a(5)=3 because there are three different subsets, {2}, {3} & {4}; a(6)=3 because there are three different subsets, {4}, {5} & {2,3}.


CROSSREFS

Cf. A070880, A088314.
Sequence in context: A188270 A026925 A237665 * A220153 A219627 A131942
Adjacent sequences: A088525 A088526 A088527 * A088529 A088530 A088531


KEYWORD

easy,nonn,changed


AUTHOR

Naohiro Nomoto, Nov 16 2003


EXTENSIONS

More terms from David Wasserman, Aug 09 2005


STATUS

approved



