login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A046806 Largest number m with A046805(m) = n. 0
11, 26, 47, 69, 107, 138, 183, 223, 267, 318, 395, 453, 517, 584, 654, 727, 827, 892, 1019, 1111, 1207, 1310, 1463, 1573, 1687, 1805, 1903, 2053, 2189, 2323, 2527, 2671, 2819, 2974, 3130, 3287, 3533, 3703, 3877, 4055, 4237, 4423, 4619, 4813, 5011, 5213, 5519 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

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

EXAMPLE

a(1)=11 since n > 11 implies there is a collection of integer-sided rectangles with dimensions at least 2 with total area n.

CROSSREFS

Sequence in context: A139576 A166137 A212018 * A224197 A027521 A238147

Adjacent sequences:  A046803 A046804 A046805 * A046807 A046808 A046809

KEYWORD

easy,nonn

AUTHOR

Erich Friedman

EXTENSIONS

More terms from Sean A. Irvine, Apr 25 2021

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 November 30 19:02 EST 2021. Contains 349424 sequences. (Running on oeis4.)