A306841 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A306841

Number of rectangles of integer sides whose area or perimeter is n.

1, 1, 1, 3, 1, 3, 1, 4, 2, 4, 1, 6, 1, 5, 2, 7, 1, 7, 1, 8, 2, 7, 1, 10, 2, 8, 2, 10, 1, 11, 1, 11, 2, 10, 2, 14, 1, 11, 2, 14, 1, 14, 1, 14, 3, 13, 1, 17, 2, 15, 2, 16, 1, 17, 2, 18, 2, 16, 1, 21, 1, 17, 3, 20, 2, 20, 1, 20, 2, 21, 1, 24, 1, 20, 3, 22, 2, 23

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,4

LINKS

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

MathOverflow, Tiling a square with rectangles whose areas or perimeters are 1, 2, 3, ..., N

FORMULA

a(n) = ceiling(d(n)/2) + floor(n/4) if n is even, a(n) = ceiling(d(n)/2) otherwise, where d(n) is the number of divisors of n.

EXAMPLE

a(4) = 3 because there are two rectangles of integer sides of area 4 (2 X 2 and 1 X 4) and one rectangle of integer sides of perimeter 4 (1 X 1).

CROSSREFS

Cf. A038548 (area n), A004526 (perimeter 2n).