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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A240498 Number of partitions p of n such that the multiplicity of min(p)*max(p) is a part. 5

%I #4 Apr 14 2014 11:13:58

%S 0,1,0,1,2,4,6,8,12,17,25,35,48,65,88,116,154,203,263,342,440,562,716,

%T 908,1141,1436,1794,2234,2771,3431,4223,5194,6359,7770,9462,11502,

%U 13929,16852,20318,24458,29364,35204,42088,50257,59865,71212,84531,100208

%N Number of partitions p of n such that the multiplicity of min(p)*max(p) is a part.

%e a(6) counts these 6 partitions: 51, 411, 3111, 21111, 321.

%t z = 60; f[n_] := f[n] = IntegerPartitions[n];

%t Table[Count[f[n], p_ /; MemberQ[p, Count[p, 2*Min[p]]]], {n, 0, z}] (* A240496 *)

%t Table[Count[f[n], p_ /; MemberQ[p, Count[p, (Min[p] + Max[p])/2]]], {n, 1, z}] (* A240497 *)

%t Table[Count[f[n], p_ /; MemberQ[p, Count[p, Min[p]*Max[p]]]], {n, 0, z}] (* A240498 *)

%t Table[Count[f[n], p_ /; MemberQ[p, Count[p, Length[p]]]], {n, 0, z}] (* A240499 *)

%t Table[Count[f[n], p_ /; MemberQ[p, Count[p, 2*Length[p]]]], {n, 0, z}] (* A240500 *)

%Y Cf. A240496, A240497, A240499, A240500.

%K nonn,easy

%O 0,5

%A _Clark Kimberling_, Apr 06 2014

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 2 04:48 EDT 2024. Contains 372178 sequences. (Running on oeis4.)