We can assume the circle has radius $1$ and is centered at the origin. By symmetry we will only consider the six rectangles above the axis. Let the height of the rectangle that has its base on the $x$ axis be $h_1$. The upper right corner is then $(\sqrt{1-h_1^2},h_1)$ and the area of the rectangle is $2h_1\sqrt{1-h_1^2}$ Let the height of the next rectangle be $h_2$. The upper corner is $(\sqrt{1-(h_1+h_2)^2},h_1+h_2)$ and the area is $2h_2\sqrt{1-(h_1+h_2)^2}$ Each succeeding rectangle has its own height and adds another term into the sum of the heights.
I made a spreadsheet to compute this.
rect is just the number of the rectangle. height is input. The base is the $y$ coordinate of the bottom of the rectangle. It starts at $0$ and is accumulated as the total of the the heights. top is the $y$ coordinate of the top of the rectangle and is the base of that rectangle plus the height. width is $2\sqrt{1-top^2}$, the width of the rectangle that puts the upper corner on the circle. area is the area of the rectangle, $height*width$. err is the area of this rectangle minus the area of the previous one. You should be able to recreate the spreadsheet and can check that the values match.
$0.115$ is a pretty good guess for the starting width. $0.12$ does not work. If you want to find a larger area, put in a larger width for the first rectangle. Then click on the err of the second and use Goal Seek to set err to $0$ by varying the height of rectangle $2$. Once that is done, do the same for each rectangle in turn. If you put in too large a number the seek will fail somewhere along the way. You can do a binary search to find the greatest height of rectangle $1$ that works. Someone who has a 1D root finder they can use as a subroutine can automate this. I don't have one at hand.
If you just want to accept this solution, you have the height and width of each rectangle. No allowance has been made for the saw kerf.