A182114 -id:A182114 - cp's OEIS frontend

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

0, 0, 0, 0, 0, 0, 0, 1, 18, 47, 124, 150, 403, 477, 684, 986, 1449, 1719, 2441, 2906, 3921, 4978, 6133, 7310, 9512, 11604, 14046, 17058, 20898, 24906, 30539, 36372, 43777, 52301, 62149, 73968, 88578, 104720, 123692, 145988, 172736, 203019, 239192, 280445

Offset: 0

Alois P. Heinz, Nov 03 2012

nonn

Alois P. Heinz, Table of n, a(n) for n = 0..100

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

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

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 10, 34, 110, 136, 425, 500, 740, 1097, 1661, 1954, 2846, 3357, 4616, 5885, 7250, 8582, 11324, 13794, 16674, 20228, 24846, 29487, 36312, 43087, 51903, 61895, 73424, 87274, 104660, 123438, 145588, 171526, 202959, 238060, 280385, 328137

Offset: 0

Alois P. Heinz, Nov 03 2012

nonn

In August 2012 a(25) = 13794 was the smallest number absent from the OEIS, see links. - Alois P. Heinz, Oct 17 2013

Alois P. Heinz, Table of n, a(n) for n = 0..100
Nicolas J.-P. Gauvrit, Jean-Paul Delahaye and Hector Zenil, Sloane’s Gap: Do Mathematical and Social Factors Explain the Distribution of Numbers in the OEIS?, Journal of Humanistic Mathematics 3:1 (2013), pp. 3-19.
James Grime and Brady Haran, Sloane's Gap, Numberphile video (2013)

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

cp's OEIS Frontend

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

Views

Author

Keywords

Links

Formula