A205217 Number of partitions of n into distinct parts having no 2 in ternary representation.

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, 6, 10, 8, 8, 10, 12, 17, 17, 13, 18, 24, 17, 14, 20, 19, 21, 26, 23, 28, 40, 34, 27, 36, 35, 28, 32, 30, 29, 42, 41, 33, 44, 50, 44, 46, 46, 46, 57, 54, 44

Offset

0,5

Links

Reinhard Zumkeller, Table of n, a(n) for n = 0..500

Example

a(20) = #{13+4+3, 12+4+3+1, 10+9+1} = 3;
a(21) = #{13+4+3+1, 12+9} = 2;
a(22) = #{13+9, 12+10, 12+9+1, 10+9+3} = 4;
a(23) = #{13+10, 13+9+1, 12+10+1, 10+9+4, 10+9+3+1} = 5;
a(24) = #{13+10+1, 12+9+3, 10+9+4+1} = 3.

Prog

(Haskell)
a205217 = p $ tail a005836_list where
   p _ 0 = 1
   p (k:ks) m = if m < k then 0 else p ks (m - k) + p ks m

Crossrefs

Cf. A205216, A007088, A005836.

Sequence in context: A357072 A024940 A324827 * A054635 A003137 A353048

Adjacent sequences: A205214 A205215 A205216 * A205218 A205219 A205220

Keyword

nonn,base

Author

Reinhard Zumkeller, Jan 25 2012

Status

approved