The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A369339 Number of partitions of n into triangular numbers not greater than sqrt(n). 0
 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 11, 11, 11, 12, 12, 12, 49, 49, 49, 56, 56, 56, 64, 64, 64, 72, 72, 72, 81, 81, 81, 90, 90, 90, 100, 100, 100, 110, 110, 110, 121, 121, 121, 132, 132, 132, 144, 144, 144, 156, 156 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,10 LINKS Table of n, a(n) for n=0..70. MATHEMATICA Table[SeriesCoefficient[Product[1/(1 - x^(k (k + 1)/2)), {k, 1, Floor[(Sqrt[1 + 8 Sqrt[n]] - 1)/2]}], {x, 0, n}], {n, 0, 70}] CROSSREFS Cf. A007294, A097356. Sequence in context: A164838 A059112 A111731 * A368868 A134992 A073260 Adjacent sequences: A369336 A369337 A369338 * A369340 A369341 A369342 KEYWORD nonn AUTHOR Ilya Gutkovskiy, Jan 20 2024 STATUS approved

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

Last modified July 20 22:19 EDT 2024. Contains 374461 sequences. (Running on oeis4.)