What kind representations exist $\forall n\in \mathbb N$?
For example, each natural number $n$ can be expressed as:
$1)$ A sum of four squares (Lagrange)
$2)$ A sum of three triangular numbers (Gauss)
$3)$ A sum of Fibonacci numbers (Zeckendorfs theorem)
$4)$ A product of primes (Fundamental theorem of Number Theory)
$5)$ Factoradic digits
$6)$ Sum of "digits" in the usual sense
Are there more representations which work for every natural number?
Here's a similar, unanswered question.
Here's a few interesting ones
Bézout's identity — Let $a$ and $b$ be integers with greatest common divisor $d$. Then there exist integers $x$ and $y$ such that $ax + by = d$. Moreover, the integers of the form $az + bt$ are exactly the multiples of $d$.
A sum of Lucas numbers. Let $m$ be a positive integer. Then, $m$ or $m − 2$ has an odd expression in Lucas numbers. You can find this result in this paper.
A sum of $9$ cubes.
Every integer greater than 11 is a sum of two composite numbers.
And last but not least, Goldbach's Conjecture.