"SWAPN" isn't something that would be universally understood. But you say you want it for your Fourier Transform algorithm, so by that, I interpret that what you want is: SWAP2(1,N).SWAP2(2,N-1).SWAP2(3,N-2)...., i.e. the pairwise swap between opposite qubits.
It depends on context as to what it is you actually want to write down. For implementing in some sort of quantum circuit, the decompostion into pairwise swaps, as I've just given it, is probably ideal. Your question seems to imply that you want a matrix. In which case,
where $x^R$ is just the bit string $x$, reversed.
However, there is a reason why you rarely see the swap gates explicitly written out at the end of the Fourier transform: they're rarely necessary. In many algorithms, you simply measure the qubits at the end. It's much easier to reorder the classical values of the outcomes after the measurement than the quantum state before the measurement. Even if you're not measuring, you're typically doing a sequence like: inverse Fourier transform - diagonal operator - Fourier transform (for example, HHL algorithm). So, you can get rid of the swaps at the end of the IQFT and the start of the QFT by cancelling them and just reordering the elements of the diagonal operator. Since this is usually associated with some sort of classical calculation, it's easily incorporated there.