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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A226749 Number of partitions of n into distinct Platonic numbers, cf. A053012. 3

%I #6 Sep 08 2022 12:55:38

%S 1,1,0,0,1,1,1,1,1,1,2,2,2,2,2,2,2,2,3,4,4,3,3,4,4,4,4,5,5,5,6,7,6,6,

%T 6,7,7,8,8,9,9,9,9,9,9,11,11,11,12,13,13,12,12,13,15,15,16,17,17,16,

%U 18,18,19,19,21,21,23,24,25,24,24,24,26,26,29,32

%N Number of partitions of n into distinct Platonic numbers, cf. A053012.

%H Reinhard Zumkeller, <a href="/A226749/b226749.txt">Table of n, a(n) for n = 0..1000</a>

%e First Platonic numbers: 1, 4, 6, 8, 10, 12, 19, 20, 27, ...

%e a(10) = #{10, 6+4} = 2;

%e a(11) = #{10+1, 6+4+1} = 2;

%e a(12) = #{12, 8+4} = 2;

%e a(13) = #{12+1, 8+4+1} = 2;

%e a(14) = #{10+4, 8+6} = 2;

%e a(15) = #{10+4+1, 8+6+1} = 2;

%e a(16) = #{12+4, 10+6} = 2;

%e a(17) = #{12+4+1, 10+6+1} = 2;

%e a(18) = #{12+6, 10+8, 8+6+4} = 3;

%e a(19) = #{19, 12+6+1, 10+8+1, 8+6+4+1} = 4;

%e a(20) = #{20, 19+1, 12+8, 10+6+4} = 4.

%o (Haskell)

%o a226749 = p a053012_list where

%o p _ 0 = 1

%o p (k:ks) m = if m < k then 0 else p ks (m - k) + p ks m

%Y Cf. A053012, A226748.

%K nonn

%O 0,11

%A _Reinhard Zumkeller_, Jun 17 2013

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 15:52 EDT 2024. Contains 371961 sequences. (Running on oeis4.)