This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A193749 Number of partitions of n into distinct parts that are squares or triangular numbers (A005214). 3
 1, 1, 0, 1, 2, 1, 1, 2, 1, 2, 4, 2, 1, 4, 4, 3, 5, 4, 3, 7, 7, 4, 6, 7, 6, 10, 10, 5, 10, 14, 10, 12, 14, 9, 14, 20, 13, 13, 20, 17, 18, 24, 17, 16, 27, 26, 22, 27, 25, 26, 35, 31, 26, 35, 37, 36, 42, 37, 35, 48, 47, 40, 49, 49, 48, 60, 58, 49, 61, 66, 61 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 LINKS Reinhard Zumkeller, Table of n, a(n) for n = 0..250 EXAMPLE a(10) = #{10, 9+1, 6+4, 6+3+1} = 4; a(11) = #{10+1, 6+4+1} = 2; a(12) = #{9+3} = 1; a(13) = #{10+3, 9+4, 9+3+1, 6+4+3} = 4. PROG (Haskell) a193749 = p a005214_list where    p _      0    = 1    p (k:ks) m      | m < k     = 0      | otherwise = p ks (m - k) + p ks m CROSSREFS Cf. A000290, A000217, A033461, A024940, A193748, A000009. Sequence in context: A261363 A116491 A131325 * A049824 A133087 A153919 Adjacent sequences:  A193746 A193747 A193748 * A193750 A193751 A193752 KEYWORD nonn AUTHOR Reinhard Zumkeller, Aug 03 2011 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 23 19:07 EDT 2019. Contains 323528 sequences. (Running on oeis4.)