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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A260411 Number of ways n can be represented as a sum of a positive cube, a positive square, and a positive triangular number. 0
 0, 0, 0, 1, 0, 1, 1, 0, 2, 0, 1, 2, 2, 2, 0, 3, 1, 1, 3, 1, 4, 0, 1, 3, 1, 2, 1, 5, 0, 2, 3, 2, 4, 2, 4, 0, 2, 3, 6, 3, 2, 3, 1, 3, 1, 5, 4, 4, 2, 2, 2, 2, 3, 5, 4, 2, 2, 3, 4, 2, 4, 1, 4, 1, 5, 4, 3, 4, 3, 4, 0, 7, 5, 5, 2, 4, 3, 1, 7, 4, 5, 3, 3, 8, 1, 2, 6, 2, 6, 2, 5 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,9 COMMENTS Indices of zeros: A115162. It appears that there are 14 zeros and 33 ones. Conjecture: every integer appears in the sequence finitely many times. LINKS EXAMPLE 8 = 1 + 1 + 6 = 1 + 4 + 3, two representations, so a(8)=2. CROSSREFS Cf. A115162. Sequence in context: A035392 A007149 A028832 * A199331 A243917 A254212 Adjacent sequences:  A260408 A260409 A260410 * A260412 A260413 A260414 KEYWORD nonn AUTHOR Alex Ratushnyak, Jul 24 2015 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 March 29 05:39 EDT 2020. Contains 333105 sequences. (Running on oeis4.)