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!)
A240177 Number of partitions of n such that (least part) >= (multiplicity of least part). 3
1, 1, 1, 2, 3, 4, 5, 8, 10, 14, 18, 24, 30, 41, 51, 66, 83, 106, 131, 167, 204, 257, 315, 391, 475, 587, 710, 869, 1049, 1275, 1529, 1852, 2213, 2662, 3173, 3796, 4506, 5373, 6356, 7544, 8900, 10523, 12373, 14585, 17101, 20085, 23494, 27508, 32087, 37471 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

LINKS

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

FORMULA

a(n) = A096403(n) + A240176(n), for n >= 0.

EXAMPLE

a(6) counts these 5 partitions:  6, 51, 42, 33, 321.

MATHEMATICA

z = 60; f[n_] := f[n] = IntegerPartitions[n]; t1 = Table[Count[f[n], p_ /; Min[p] < Count[p, Min[p]]], {n, 0, z}]  (* A240175 *)

t2 = Table[Count[f[n], p_ /; Min[p] <= Count[p, Min[p]]], {n, 0, z}] (* A188216 *)

t3 = Table[Count[f[n], p_ /; Min[p] == Count[p, Min[p]]], {n, 0, z}] (* A096403 *)

t4 = Table[Count[f[n], p_ /; Min[p] > Count[p, Min[p]]], {n, 0, z}] (* A240176 *)

t5 = Table[Count[f[n], p_ /; Min[p] >= Count[p, Min[p]]], {n, 0, z}] (* A240177 *)

CROSSREFS

Cf. A188216, A096403, A240175, A240176.

Sequence in context: A035562 A107234 A035943 * A035555 A039875 A206555

Adjacent sequences:  A240174 A240175 A240176 * A240178 A240179 A240180

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling, Apr 02 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 October 26 17:13 EDT 2020. Contains 338027 sequences. (Running on oeis4.)