Pair the odd numbers such that the k-th pair is (r, r+2k) where r is the smallest odd number not included earlier: (1, 3), (5, 9), (7, 13), (11, 19), (15, 25), (17, 29), (21, 35), (23, 39), (27, 45), ... This is the sequence of the product of the members of pairs.
A075320 := proc(nmax) local r, k, a, pairs ; a := [3] ; pairs := [1, 3] ; k := 2 ; r := 5 ; while nops(a) < nmax do while r in pairs do r := r+2 ; od ; if r+2*k in pairs then printf("inconsistency", k) ; fi ; a := [op(a), r*(r+2*k)] ; pairs := [op(pairs), r, r+2*k] ; k := k+1 ; od ; RETURN(a) ; end: a := A075320(200) : for n from 1 to nops(a) do printf("%d, ", op(n, a)) ; od ; # R. J. Mathar, Nov 12 2006