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!)
A241552 Number of partitions p of n such that (number of numbers of the form 5k + 3 in p) is a part of p. 5
0, 0, 0, 0, 1, 1, 2, 3, 5, 8, 12, 17, 23, 34, 47, 64, 87, 115, 154, 204, 266, 346, 444, 573, 731, 933, 1174, 1479, 1855, 2320, 2884, 3578, 4411, 5443, 6678, 8185, 9977, 12157, 14753, 17886, 21608, 26058, 31326, 37631, 45066, 53911, 64300, 76609, 91061 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,7

COMMENTS

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

LINKS

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

EXAMPLE

a(6) counts these 2 partitions:  321, 3111.

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. A241549, A241550, A241551, A241553.

Sequence in context: A177205 A275580 A175829 * A175827 A061535 A280276

Adjacent sequences:  A241549 A241550 A241551 * A241553 A241554 A241555

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 20:45 EDT 2020. Contains 335669 sequences. (Running on oeis4.)