The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A218624 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

A218624

Number of partitions of n+3 with largest inscribed rectangle having area <= n.
(history; published version)

#5 by Alois P. Heinz at Sat Nov 03 16:55:20 EDT 2012

STATUS

editing

approved

#4 by Alois P. Heinz at Sat Nov 03 16:26:14 EDT 2012

FORMULA

a(n) = A182114(n+2,3,n).

#3 by Alois P. Heinz at Sat Nov 03 16:21:49 EDT 2012

LINKS

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

#2 by Alois P. Heinz at Sat Nov 03 16:21:26 EDT 2012

NAME

allocated for Alois P. Heinz

Number of partitions of n+3 with largest inscribed rectangle having area <= n.

DATA

0, 0, 0, 0, 3, 5, 17, 22, 39, 57, 85, 107, 162, 208, 273, 360, 474, 597, 774, 970, 1233, 1553, 1937, 2396, 2991, 3694, 4539, 5572, 6822, 8309, 10125, 12278, 14859, 17950, 21605, 25972, 31171, 37312, 44553, 53132, 63241, 75135, 89114, 105522, 124722, 147249

OFFSET

0,5

FORMULA

a(n) = A182114(n+2,n).

KEYWORD

allocated

nonn

AUTHOR

Alois P. Heinz, Nov 03 2012

STATUS

approved

editing

#1 by Alois P. Heinz at Sat Nov 03 15:51:20 EDT 2012

NAME

allocated for Alois P. Heinz

KEYWORD

allocated

STATUS

approved