The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A365903 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A365903

Number of partitions of [n] whose block minima sum to k, where k is chosen so as to maximize this number.
(history; published version)

#21 by Alois P. Heinz at Thu Oct 03 07:52:57 EDT 2024

STATUS

reviewed

approved

#20 by Joerg Arndt at Thu Oct 03 05:43:06 EDT 2024

STATUS

proposed

reviewed

#19 by Jean-François Alcover at Thu Oct 03 03:52:59 EDT 2024

STATUS

editing

proposed

#18 by Jean-François Alcover at Thu Oct 03 03:52:40 EDT 2024

MATHEMATICA

Q[1, t_, s_] := t*s;

Q[n_, t_, s_] := Q[n, t, s] = s*D[Q[n-1, t, s], s] + s*t^n*Q[n-1, t, s] // Expand;

P[n_, t_] := Module[{s}, Q[n, t, s] /. s -> 1];

a[n_] := If[n == 0, 1, Module[{t}, CoefficientList[P[n, t], t] // Max]];

Table[a[n], {n, 0, 26}] (* Jean-François Alcover, Oct 03 2024 *)

STATUS

approved

editing

#17 by OEIS Server at Sat Dec 16 22:11:34 EST 2023

LINKS

Alois P. Heinz, <a href="/A365903/b365903_1.txt">Table of n, a(n) for n = 0..100</a>

#16 by Alois P. Heinz at Sat Dec 16 22:11:34 EST 2023

STATUS

editing

approved

Discussion

Sat Dec 16

22:11

OEIS Server: Installed new b-file as b365903.txt.  Old b-file is now b365903_1.txt.

#15 by Alois P. Heinz at Sat Dec 16 22:11:32 EST 2023

LINKS

Alois P. Heinz, <a href="/A365903/b365903_1.txt">Table of n, a(n) for n = 0..92100</a>

STATUS

approved

editing

#14 by OEIS Server at Sat Dec 16 21:23:11 EST 2023

LINKS

Alois P. Heinz, <a href="/A365903/b365903_1.txt">Table of n, a(n) for n = 0..92</a>

#13 by Alois P. Heinz at Sat Dec 16 21:23:11 EST 2023

STATUS

editing

approved

Discussion

Sat Dec 16

21:23

OEIS Server: Installed first b-file as b365903.txt.

#12 by Alois P. Heinz at Sat Dec 16 21:23:05 EST 2023

LINKS

Wikipedia, <a href="https://en.wikipedia.org/wiki/Partition_of_a_set">Partition of a set</a>