Even if you manage to construct an insert sequence that, with a particular hash seed, results in Ω(N²) time to insert N keys, that still doesn't prove insertion isn't O(1) amortized time, with the amortization taken over all insert sequences, and/or all hash seeds.