This site is supported by donations to The OEIS Foundation.

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A218631 Number of partitions of n+10 with largest inscribed rectangle having area <= n. 2
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,9 COMMENTS In August 2012 a(25) = 13794 was the smallest number absent from the OEIS, see links. - Alois P. Heinz, Oct 17 2013 LINKS 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 (2013) FORMULA a(n) = A182114(n+10,n). CROSSREFS Sequence in context: A119171 A119229 A119227 * A166066 A232583 A068078 Adjacent sequences:  A218628 A218629 A218630 * A218632 A218633 A218634 KEYWORD nonn AUTHOR Alois P. Heinz, Nov 03 2012 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified November 23 11:48 EST 2014. Contains 249842 sequences.