|
Search: id:A026905
|
|
|
| A026905 |
|
a(n) = number of sums S of positive integers satisfying S <= n. |
|
+0
14
|
|
| 1, 3, 6, 11, 18, 29, 44, 66, 96, 138, 194, 271, 372, 507, 683, 914, 1211, 1596, 2086, 2713, 3505, 4507, 5762, 7337, 9295, 11731, 14741, 18459, 23024, 28628, 35470, 43819, 53962, 66272, 81155, 99132, 120769, 146784, 177969, 215307
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Row sums of triangle A137633 - Gary W. Adamson (qntmpkt(AT)yahoo.com), Jan 31 2008
Equals row sums of triangle A137679 - Gary W. Adamson (qntmpkt(AT)yahoo.com), Feb 05 2008
|
|
LINKS
|
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 800
|
|
FORMULA
|
Jeff Burch (gburch(AT)erols.com) points out that this is just the partial sums of the partition numbers.
a(n) = A000070(n) - 1, n>=1.
Row sums of triangle A133737 - Gary W. Adamson (qntmpkt(AT)yahoo.com), Sep 22 2007
|
|
MAPLE
|
a:=n->add(numbpart(k), k=1..n): seq(a(n), n=1..40); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jun 01 2008
|
|
MATHEMATICA
|
Table[ Sum[ PartitionsP[k], {k, 1, n}], {n, 1, 45}]
|
|
CROSSREFS
|
Cf. A133737.
Cf. A137633.
Cf. A137679.
Sequence in context: A095944 A014284 A118482 this_sequence A066778 A123629 A053992
Adjacent sequences: A026902 A026903 A026904 this_sequence A026906 A026907 A026908
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu)
|
|
|
Search completed in 0.002 seconds
|
