|
Search: id:A024940
|
|
|
| A024940 |
|
Number of partitions of n into distinct triangular numbers C(k,2). |
|
+0
3
|
|
| 1, 0, 1, 1, 0, 1, 1, 0, 1, 2, 1, 0, 1, 1, 1, 2, 1, 1, 2, 1, 2, 2, 0, 2, 3, 1, 1, 3, 2, 1, 4, 3, 0, 3, 3, 2, 4, 3, 3, 3, 2, 3, 3, 2, 4, 6, 4, 2, 5, 4, 2, 6, 5, 3, 7, 6, 3, 5, 5, 5, 6, 5, 4, 7, 7, 6, 8, 6, 5, 9, 7, 4, 9, 9, 6, 10, 9, 4, 9, 10, 8, 11, 11, 9, 10, 10, 9, 10, 10, 9, 14, 14, 7, 14, 14, 7, 15, 15, 8, 15, 17, 13
(list; graph; listen)
|
|
|
OFFSET
|
1,10
|
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n = 1..1000
|
|
FORMULA
|
For n>0: a(n) = b(n, 1) where b(n, k) = if n>k*(k+1)/2 then b(n-k*(k+1)/2, k+1) + b(n, k+1) else (if n=k*(k+1)/2 then 1 else 0). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Aug 26 2003
|
|
MATHEMATICA
|
Drop[ CoefficientList[ Series[ Product[(1 + x^(k*(k + 1)/2)), {k, 1, 15}], {x, 0, 102}], x], 1]
|
|
CROSSREFS
|
Cf. A000217.
Sequence in context: A053259 A143842 A092876 this_sequence A054635 A003137 A006842
Adjacent sequences: A024937 A024938 A024939 this_sequence A024941 A024942 A024943
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu)
|
|
|
Search completed in 0.002 seconds
|
