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!)
A241344 Number of partitions p of n such that floor(mean(p)) or ceiling(mean(p)) is a part. 5
0, 1, 2, 3, 4, 6, 8, 12, 16, 22, 31, 44, 50, 78, 102, 125, 163, 230, 271, 379, 441, 575, 760, 978, 1073, 1457, 1865, 2250, 2704, 3544, 3955, 5293, 6154, 7637, 9533, 11171, 12702, 16718, 20215, 23926, 26949, 34725, 39187, 49415, 56914, 66105, 82244, 98231 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
EXAMPLE
a(6) counts these 8 partitions: 6, 33, 321, 3111, 222, 21111, 111111.
MATHEMATICA
z = 30; f[n_] := f[n] = IntegerPartitions[n];
t1 = Table[Count[f[n], p_ /; MemberQ[p, Floor[Mean[p]]] && MemberQ[p, Ceiling[Mean[p]]]], {n, 0, z}] (* A241340 *)
t2 = Table[Count[f[n], p_ /; ! MemberQ[p, Floor[Mean[p]]] && MemberQ[p, Ceiling[Mean[p]]]], {n, 0, z}] (* A241341 *)
t3 = Table[Count[f[n], p_ /; MemberQ[p, Floor[Mean[p]]] && ! MemberQ[p, Ceiling[Mean[p]]]], {n, 0, z}] (* A241342 *)
t4 = Table[Count[f[n], p_ /; ! MemberQ[p, Floor[Mean[p]]] && ! MemberQ[p, Ceiling[Mean[p]]]], {n, 0, z}] (* A241343 *)
t5 = Table[Count[f[n], p_ /; MemberQ[p, Floor[Mean[p]]] || MemberQ[p, Ceiling[Mean[p]]]], {n, 0, z}] (* A241344 *)
CROSSREFS
Sequence in context: A005987 A241828 A125895 * A064428 A052810 A364964
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Apr 20 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 16 05:35 EDT 2024. Contains 371697 sequences. (Running on oeis4.)