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!)
 A307597 Number of partitions of n into 2 distinct positive triangular numbers. 11
 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 2, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 2, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 2, 0, 1, 1, 0, 2, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 2, 0, 0, 1, 0, 3, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 2, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 3, 0, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,17 COMMENTS The greedy inverse (positions of first occurrence of n) starts 0, 4, 16, 81, 471, 2031, 1381, 11781, 6906, 17956, ... - R. J. Mathar, Apr 28 2020 LINKS Alois P. Heinz, Table of n, a(n) for n = 0..65536 (first 10000 terms from David A. Corneth) FORMULA a(n) = [x^n y^2] Product_{k>=1} (1 + y*x^(k*(k+1)/2)). EXAMPLE a(16) = 2 because we have [15, 1] and [10, 6]. CROSSREFS Cf. A000217, A008441, A024940, A025441, A052344, A053603, A260647, A307598. Sequence in context: A221314 A326642 A087371 * A307056 A112762 A145171 Adjacent sequences:  A307594 A307595 A307596 * A307598 A307599 A307600 KEYWORD nonn,easy AUTHOR Ilya Gutkovskiy, Apr 17 2019 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 May 7 02:20 EDT 2021. Contains 343636 sequences. (Running on oeis4.)