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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A240869 Number of partitions of n into distinct parts of which the number of even parts is not a part. 3
 0, 1, 1, 1, 2, 2, 2, 3, 3, 5, 5, 7, 8, 11, 12, 15, 18, 22, 27, 31, 37, 43, 52, 59, 71, 82, 97, 110, 128, 148, 173, 197, 225, 260, 298, 339, 386, 442, 502, 570, 644, 733, 829, 935, 1052, 1190, 1339, 1504, 1687, 1897, 2128, 2380, 2659, 2976, 3325, 3704, 4127 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 LINKS Table of n, a(n) for n=0..56. FORMULA a(n) + A240573(n) = A000009(n) for n >= 1. EXAMPLE a(9) counts these 5 partitions: 9, 72, 63, 54, 531. MATHEMATICA z = 40; f[n_] := f[n] = Select[IntegerPartitions[n], Max[Length /@ Split@#] == 1 &]; t1 = Table[Count[f[n], p_ /; ! MemberQ[p, Count[Mod[p, 2], 0]]], {n, 0, z}] (* A240869 *) t2 = Table[Count[f[n], p_ /; ! MemberQ[p, Count[Mod[p, 2], 1]]], {n, 0, z}] (* A240870 *) CROSSREFS Cf. A240870, A240573, A000009. Sequence in context: A029097 A210955 A051697 * A367395 A065308 A035680 Adjacent sequences: A240866 A240867 A240868 * A240870 A240871 A240872 KEYWORD nonn,easy AUTHOR Clark Kimberling, Apr 14 2014 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.

Last modified August 14 22:14 EDT 2024. Contains 375167 sequences. (Running on oeis4.)