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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A321028 a(n) = 6 + round(n^3) - (minimal number of squares in a dissection of an (n) X (n+1) oblong into squares). 0
5, 4, 3, 3, 3, 3, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 2, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 0, 0, 0, 0, 0, 0, 0, -1, -1, 0, 0, 0, 0, 0, 0, -1, 0, -1, 0, -1, 0, -1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

After a(18)=2, all terms through a(387) are in (-1,0,1). The first known term outside of this range is a(969) >= 2.

LINKS

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

B. Felgenhauer, Filling Rectangles with Integer-Sided Squares

Ed Pegg Jr, Minimally Squared Rectangles

Ed Pegg Jr on StackExchange, Oblongs into minimal squares, Dec 13 2016.

FORMULA

a(n) = 6 + A105209(n) - A279317(n).

CROSSREFS

Cf. A105209, A279317.

Sequence in context: A194744 A132669 A276052 * A263356 A061836 A021188

Adjacent sequences:  A321025 A321026 A321027 * A321029 A321030 A321031

KEYWORD

hard,sign

AUTHOR

Ed Pegg Jr, Oct 26 2018

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 June 22 05:44 EDT 2021. Contains 345367 sequences. (Running on oeis4.)