The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A240855 Number of partitions p of n into distinct parts including the number of parts. 2
 0, 1, 0, 1, 0, 1, 2, 1, 2, 3, 4, 3, 5, 6, 8, 9, 10, 12, 16, 18, 22, 25, 29, 34, 41, 48, 55, 64, 74, 84, 98, 114, 130, 150, 170, 195, 222, 252, 287, 328, 371, 420, 475, 536, 604, 682, 766, 862, 970, 1088, 1218, 1365, 1526, 1704, 1904, 2124, 2366, 2637, 2934 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,7 LINKS FORMULA a(n) + A240861(n) = A000009(n) for n >= 0. EXAMPLE a(10) counts these 4 partitions:  82, 631, 532, 4321. MATHEMATICA z = 40; f[n_] := f[n] = Select[IntegerPartitions[n], Max[Length /@ Split@#] == 1 &]; Table[Count[f[n], p_ /; MemberQ[p, Length[p]]], {n, 0, z}] (* A240855 *)     Table[Count[f[n], p_ /; !MemberQ[p, Length[p]]], {n, 0, z}] (* A240861 *) CROSSREFS Cf. A240861, A000009. Sequence in context: A162330 A134967 A320581 * A084612 A295164 A241419 Adjacent sequences:  A240852 A240853 A240854 * A240856 A240857 A240858 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified February 26 17:19 EST 2020. Contains 332293 sequences. (Running on oeis4.)