The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A341794 Number of ways to write n as an ordered sum of 3 nonzero tetrahedral numbers. 8
 1, 0, 0, 3, 0, 0, 3, 0, 0, 4, 0, 0, 6, 0, 0, 3, 0, 0, 3, 3, 0, 3, 6, 0, 0, 3, 0, 1, 6, 0, 0, 6, 0, 0, 3, 0, 0, 9, 3, 0, 3, 3, 0, 6, 0, 0, 6, 3, 0, 0, 0, 0, 3, 6, 0, 3, 6, 1, 6, 0, 0, 3, 6, 0, 6, 0, 0, 6, 3, 0, 0, 3, 3, 3, 6, 0, 0, 9, 0, 0, 0, 0, 0, 9, 0, 0, 6, 3, 0, 9, 0, 0, 12 (list; graph; refs; listen; history; text; internal format)
 OFFSET 3,4 LINKS FORMULA G.f.: ( Sum_{k>=1} x^binomial(k+2,3) )^3. MATHEMATICA nmax = 95; CoefficientList[Series[Sum[x^Binomial[k + 2, 3], {k, 1, nmax}]^3, {x, 0, nmax}], x] // Drop[#, 3] & CROSSREFS Cf. A000292, A023533, A023670, A053604, A282582, A341774, A341795, A341796, A341797. Sequence in context: A021337 A293903 A284444 * A033685 A272974 A063691 Adjacent sequences:  A341791 A341792 A341793 * A341795 A341796 A341797 KEYWORD nonn AUTHOR Ilya Gutkovskiy, Feb 19 2021 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 7 13:08 EST 2021. Contains 349581 sequences. (Running on oeis4.)