|
Search: id:A162932
|
|
| |
|
| 1, 0, 1, 1, 1, 1, 3, 1, 3, 4, 4, 4, 8, 6, 10, 11, 13, 15, 22, 20, 28, 33, 39, 43, 58, 60, 77, 88, 104, 119, 148, 160, 197, 226, 265, 300, 363, 404, 481, 549, 638, 727, 858, 961, 1126, 1283, 1480, 1680, 1953, 2201, 2544, 2887, 3309, 3750, 4312, 4857, 5566, 6301, 7175
(list; graph; listen)
|
|
|
OFFSET
|
6,7
|
|
|
COMMENT
|
a(n) counts partitions of n such that all parts are >=2 and the largest
part occurs at least three times.
|
|
EXAMPLE
|
For n = 19 the a(19)=6 partitions are 5554, 44443, 55522, 444322, 3333322, and 33322222.
|
|
CROSSREFS
|
Cf. A162931, A079946
Sequence in context: A050121 A029152 A089958 this_sequence A008924 A021323 A147549
Adjacent sequences: A162929 A162930 A162931 this_sequence A162933 A162934 A162935
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Alford Arnold (Alford1940(AT)aol.com), Jul 17 2009
|
|
EXTENSIONS
|
Keyword:tabf removed, indexing corrected, sequence extended by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Sep 17 2009
|
|
|
Search completed in 0.002 seconds
|
