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!)
 A240489 Number of partitions of n containing m(4) as a part, where m denotes multiplicity. 5
 0, 0, 0, 0, 0, 1, 1, 2, 3, 4, 7, 10, 14, 20, 27, 38, 52, 70, 93, 123, 161, 210, 272, 350, 447, 571, 722, 911, 1144, 1430, 1782, 2213, 2736, 3374, 4146, 5082, 6208, 7567, 9194, 11146, 13481, 16265, 19579, 23522, 28192, 33731, 40274, 47998, 57096, 67805, 80379 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,8 LINKS EXAMPLE a(10) counts these 7 partitions:  541, 442, 4321, 43111, 42211, 421111, 4111111. MATHEMATICA z = 60; f[n_] := f[n] = IntegerPartitions[n]; Table[Count[f[n], p_ /; MemberQ[p, Count[p, 1]]], {n, 0, z}] (* A240486 *) Table[Count[f[n], p_ /; MemberQ[p, Count[p, 2]]], {n, 0, z}] (* A240487 *) Table[Count[f[n], p_ /; MemberQ[p, Count[p, 3]]], {n, 0, z}] (* A240488 *) Table[Count[f[n], p_ /; MemberQ[p, Count[p, 4]]], {n, 0, z}] (* A240489 *) Table[Count[f[n], p_ /; MemberQ[p, Count[p, 5]]], {n, 0, z}] (* A240490 *) CROSSREFS Cf. A240486, A240487, A240488, A240490. Sequence in context: A062426 A184639 A035565 * A056513 A056518 A160644 Adjacent sequences:  A240486 A240487 A240488 * A240490 A240491 A240492 KEYWORD nonn,easy AUTHOR Clark Kimberling, Apr 06 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 October 31 08:46 EDT 2020. Contains 338101 sequences. (Running on oeis4.)