The golden ratio solves x = 1 + 1/x. Change the 1 to any positive integer k and you get the metallic ratios: x = k + 1/x. k=1 is golden (≈1.618); k=2 is silver (1+√2 ≈ 2.414, the ratio of a square's diagonal-plus-side); k=3 is bronze. Each has its own continued fraction (all ks) and its own Fibonacci-like sequence (the “k-bonacci” via a(n)=k·a(n−1)+a(n−2)). φ is not unique in kind — it is the smallest, the k=1 door into a whole metallic family.
The demo iterates x → k + 1/x for several k — golden, silver, bronze — each converging to its metallic ratio: live demo
“The golden ratio is one-of-a-kind.” — it is the first of an infinite metallic family; silver and bronze are its siblings, each a k + 1/x fixed point. cited
One template, a metal for every integer; φ the humble first. The golden ratio, generalized. de Spinadel 1990s
On the canonical compiler, iterating x → k + 1/x gives golden (k=1) = 1.618 and silver (k=2) = 2.414 = 1+√2: