|
%I #12 Jul 13 2013 12:04:21
%S 1,1,0,1,2,1,0,1,1,1,2,1,2,5,4,2,4,5,2,2,3,2,4,5,3,5,8,6,5,6,6,7,7,4,
%T 6,10,8,8,10,12,17,17,13,18,24,17,14,20,19,21,26,23,28,40,34,27,36,35,
%U 28,32,30,29,42,41,33,44,50,44,46,46,46,57,54,44
%N Number of partitions of n into distinct parts having no 2 in ternary representation.
%H Reinhard Zumkeller, <a href="/A205217/b205217.txt">Table of n, a(n) for n = 0..500</a>
%e a(20) = #{13+4+3, 12+4+3+1, 10+9+1} = 3;
%e a(21) = #{13+4+3+1, 12+9} = 2;
%e a(22) = #{13+9, 12+10, 12+9+1, 10+9+3} = 4;
%e a(23) = #{13+10, 13+9+1, 12+10+1, 10+9+4, 10+9+3+1} = 5;
%e a(24) = #{13+10+1, 12+9+3, 10+9+4+1} = 3.
%o (Haskell)
%o a205217 = p $ tail a005836_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. A205216, A007088, A005836.
%K nonn,base
%O 0,5
%A _Reinhard Zumkeller_, Jan 25 2012
|
