|
| |
|
|
A052810
|
|
1 + number of partitions of n, n>0.
|
|
1
| |
|
|
1, 2, 3, 4, 6, 8, 12, 16, 23, 31, 43, 57, 78, 102, 136, 177, 232, 298, 386, 491, 628, 793, 1003, 1256, 1576, 1959, 2437, 3011, 3719, 4566, 5605, 6843, 8350, 10144, 12311, 14884, 17978, 21638, 26016, 31186, 37339, 44584, 53175, 63262, 75176, 89135
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
COMMENTS
| For n>0: number of occurrences of n in partitions of 2*n: a(n)=A066633(2*n,n), cf. A058696. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Feb 22 2004
|
|
|
LINKS
| INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 772
|
|
|
FORMULA
| G.f.: (-x-exp(Sum(-x^j[1]/(x^j[1]-1)/j[1], j[1]=1 .. infinity))+exp(Sum(-x^j[1]/(x^j[1]-1)/j[1], j[1]=1 .. infinity))*x)/(-1+x)
|
|
|
MAPLE
| spec := [S, {B=Set(C), C=Sequence(Z, 1 <= card), S=Union(C, B)}, unlabeled]: seq(combstruct[count](spec, size=n), n=0..20);
with(combinat): A052810 := numbpart+1; [ seq(numbpart(i)+1, i=1..50) ];
|
|
|
CROSSREFS
| Cf. A052810(n)=A000041(n)+1.
Sequence in context: A005987 A125895 A064428 * A079647 A164090 A029744
Adjacent sequences: A052807 A052808 A052809 * A052811 A052812 A052813
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| encyclopedia(AT)pommard.inria.fr, Jan 25 2000
|
|
|
EXTENSIONS
| Better description and more terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Oct 06 2001
|
| |
|
|
