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!)
A205217 Number of partitions of n into distinct parts having no 2 in ternary representation. 2
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,5
LINKS
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
Sequence in context: A357072 A024940 A324827 * A054635 A003137 A353048
KEYWORD
nonn,base
AUTHOR
Reinhard Zumkeller, Jan 25 2012
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 01:36 EDT 2024. Contains 371264 sequences. (Running on oeis4.)