|
Search: id:A063993
|
|
|
| A063993 |
|
Number of ways of writing n as an unordered sum of exactly 3 nonzero triangular numbers. |
|
+0
3
|
|
| 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 2, 1, 1, 1, 1, 2, 1, 2, 0, 2, 2, 2, 1, 1, 2, 2, 2, 0, 3, 2, 2, 2, 2, 2, 1, 3, 1, 2, 3, 2, 2, 2, 2, 3, 2, 2, 3, 3, 1, 2, 5, 1, 2, 1, 2, 5, 3, 3, 1, 4, 2, 3, 2, 2, 4, 4, 2, 1, 4, 3, 3, 3, 2, 4, 3, 3, 3, 4, 2, 1, 6, 1, 5, 3, 3, 5, 2, 2, 2, 5, 2, 5, 4, 2, 4, 5, 3, 1
(list; graph; listen)
|
|
|
OFFSET
|
0,13
|
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=0..5050
|
|
EXAMPLE
|
5 = 3 + 1 + 1, so a(5) = 1.
|
|
MATHEMATICA
|
a = Table[ n(n + 1)/2, {n, 1, 15} ]; b = {0}; c = Table[ 0, {100} ]; Do[ b = Append[ b, a[ [ i ] ] + a[ [ j ] ] + a[ [ k ] ] ], {k, 1, 15}, {j, 1, k}, {i, 1, j} ]; b = Delete[ b, 1 ]; b = Sort[ b ]; l = Length[ b ]; Do[ If[ b[ [ n ] ] < 100, c[ [ b[ [ n ] ] + 1 ] ]++ ], {n, 1, l} ]; c
|
|
CROSSREFS
|
Cf. A053604, A008443, A002636, A064181.
Sequence in context: A084115 A080028 A143223 this_sequence A115722 A115721 A138330
Adjacent sequences: A063990 A063991 A063992 this_sequence A063994 A063995 A063996
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
njas, Sep 18 2001
|
|
EXTENSIONS
|
More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Sep 20 2001
|
|
|
Search completed in 0.002 seconds
|
