Fillomino - Minimal sum of givens

1x1 - 0 - http://pzv.jp/p.html?fillomino/1/1/g
	Trivial case.

2x2 - 1 - http://pzv.jp/p.html?fillomino/2/2/h1g
	Also a trivial case.

3x3 - 3 - http://pzv.jp/p.html?fillomino/3/3/h1g1g1h
	Slightly less trivial. It's obvious that the unclued cells need to be divided to avoid an ambiguity, and that lends itself to this pattern.

4x4 - 8 - http://pzv.jp/p.html?fillomino/4/4/i112g2h1j1
	Actually unique, doesn't rely on 1s.
4x4 - 7 - http://pzv.jp/p.html?fillomino/4/4/j123j1j  (sadly, not unique)
	Introduces a new pattern that appeared to be the backbone of minimizing givens, until I figured out the optimal solution.
4x4 - 5 - http://pzv.jp/p.html?fillomino/4/4/i11g1h1j1g
	Went back and optimized for the uninteresting type.

5x5 - 11 - http://pzv.jp/p.html?fillomino/5/5/i1g121o321k
	I like what this one hides. I was unsure if this was optimal, and couldn't find better without resorting to an OP pattern.
5x5 - 8 - http://pzv.jp/p.html?fillomino/5/5/h1i1g1g1i1g1g1i1h
	And then I realized that this pattern kind of breaks the entire challenge. Still, I liked the upper puzzle enough to archive.

6x6 - 18 - http://pzv.jp/p.html?fillomino/6/6/k1123k1j1l23211k
	I wonder if there's a better construction without resorting to The Pattern™?
6x6 - 12 - http://pzv.jp/p.html?fillomino/6/6/h1j1g1g11i1h1g1j1g1h1i1

7x7 - 24 - http://pzv.jp/p.html?fillomino/7/7/1k1i12i21g12h1i1h21g12i21i1k1
	Completely different pattern than my other constructed attempts. Led me to The Pattern™.
7x7 - 17 - http://pzv.jp/p.html?fillomino/7/7/h1i1g1g1g1g1i1i1g1g1i1i1g1g1g1g1i1h
		   http://pzv.jp/p.html?fillomino/7/7/h1g1i1i1g1g1g1g1i1i1g1g1g1g1i1i1g1h
	And this is the logical extent of the pattern, in two formations. I didn't push any farther.