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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A241549 Number of partitions p of n such that (number of numbers of the form 5k in p) is a part of p. 5
0, 0, 0, 0, 0, 0, 1, 1, 2, 3, 5, 8, 12, 17, 25, 35, 48, 67, 91, 122, 163, 215, 283, 369, 478, 615, 786, 1004, 1270, 1604, 2014, 2521, 3139, 3902, 4824, 5954, 7314, 8970, 10957, 13362, 16232, 19691, 23804, 28737, 34581, 41559, 49802, 59596, 71139, 84799 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,9

COMMENTS

Each number in p is counted once, regardless of its multiplicity.

LINKS

Table of n, a(n) for n=0..49.

EXAMPLE

a(6) counts this single partition:  51.

MATHEMATICA

z = 30; f[n_] := f[n] = IntegerPartitions[n]; s[k_, p_] := Count[Mod[DeleteDuplicates[p], 5], k]

Table[Count[f[n], p_ /; MemberQ[p, s[0, p]]], {n, 0, z}]  (* A241549 *)

Table[Count[f[n], p_ /; MemberQ[p, s[1, p]]], {n, 0, z}]  (* A241550 *)

Table[Count[f[n], p_ /; MemberQ[p, s[2, p]]], {n, 0, z}]  (* A241551 *)

Table[Count[f[n], p_ /; MemberQ[p, s[3, p]]], {n, 0, z}]  (* A241552 *)

Table[Count[f[n], p_ /; MemberQ[p, s[4, p]]], {n, 0, z}]  (* A241553 *)

CROSSREFS

Cf. A241550, A241551, A241552, A241553.

Sequence in context: A235945 A129504 A241553 * A266773 A024789 A318028

Adjacent sequences:  A241546 A241547 A241548 * A241550 A241551 A241552

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling, Apr 26 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 12 06:21 EDT 2020. Contains 335658 sequences. (Running on oeis4.)