Maximum quadrilaterals (noch nicht übersetzt)

Consider a positive integer sequence S = (s₁, s₂, ..., s_n).

Let f(S) be the perimeter of the maximum-area quadrilateral whose side lengths are 4 elements (s_i, s_j, s_k, s_l) of S (all i, j, k, l distinct). If there are many quadrilaterals with the same maximum area, then choose the one with the largest perimeter.

For example, if S = (8, 9, 14, 9, 27), then we can take the elements (9, 14, 9, 27) and form an isosceles trapezium with parallel side lengths 14 and 27 and both leg lengths 9. The area of this quadrilateral is 127.611470879... It can be shown that this is the largest area for any quadrilateral that can be formed using side lengths from S. Therefore, f(S) = 9 + 14 + 9 + 27 = 59.

Let u_n = 2^B(3n) + 3^B(2n) + B(n+1), where B(k) is the number of 1 bits of k in base 2.
For example, B(6) = 2, B(10) = 2 and B(15) = 4, and u₅ = 2⁴ + 3² + 2 = 27.

Also, let U_n be the sequence (u₁, u₂, ..., u_n).
For example, U₁₀ = (8, 9, 14, 9, 27, 16, 36, 9, 27, 28).

It can be shown that f(U₅) = 59, f(U₁₀) = 118, f(U₁₅₀) = 3223.
It can also be shown that ∑ f(U_n) = 234761 for 4 ≤ n ≤ 150.
Find ∑ f(U_n) for 4 ≤ n ≤ 3 000 000.