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!)
A157046 Maximum number of partitions of n into exactly k parts, each <= k. a(n) is maximum in each row of A157044. 3
1, 1, 1, 1, 2, 2, 3, 4, 5, 6, 8, 10, 12, 16, 19, 24, 31, 37, 46, 58, 70, 86, 104, 127, 156, 185, 222, 273, 326, 392, 463, 556, 669, 792, 939, 1109, 1317, 1564, 1838, 2156, 2535, 2986, 3514, 4100, 4777, 5577, 6526, 7621, 8847, 10251, 11869, 13807, 16032, 18529, 21370 (list; table; graph; refs; listen; history; text; internal format)
OFFSET

1,5

COMMENTS

Without the constraint on each part being <=k: see A008284 and A002569.

LINKS

Table of n, a(n) for n=1..55.

EXAMPLE

For n=9 the counts of partitions for k=1..9 is 0,0,1,4,5,3,2,1,1 so the maximum is 5 (at k=5).

MATHEMATICA

Max @@@ Table[T[n, k, k]-T[n, k-1, k], {n, 1, 128}, {k, n}] with T[n, a, b] as defined in A047993.

CROSSREFS

A157044, A157046, A047993, A008284, A002569

Sequence in context: A258875 A179241 A316082 * A017979 A140881 A316081

Adjacent sequences:  A157043 A157044 A157045 * A157047 A157048 A157049

KEYWORD

nonn,tabl

AUTHOR

Wouter Meeussen, Feb 22 2009

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 March 31 15:40 EDT 2020. Contains 333151 sequences. (Running on oeis4.)