Why can't I find this formula in Wiki or Wolfram? (pet peeve)

[Batalov]

For Lucas numbers:
\({L(3n) \over L(n)} = L(2n)-(-1)^n\)
...or if n is even, simpler still: \({L(6m) \over L(2m)} = L(4m)-1 \)

For example: this simplifies L2250 (or primV(2250)) cofactor shorthand, or primV(122754)

Well, for sure this is a partial case of (14) in Wolfram (multiple-angle recurrence), but it is sort of elegant to get a separate trivial case line, for convenience.

And similarly
\({F_{3n} \over F_n} = L_n^2-(-1)^n\)
(this one is in Wolfram in disguise, (66))

[LaurV]

Originally Posted by Batalov

\({F_{3n} \over F_n} = L_n^2-(-1)^n\)

Uh, man, you should say that's Fibonacci!
For a beat, my heart went boom, I thought you just found a way to factor Fermat\(_{24}\)

[Dr Sardonicus]

The Lucas identity follows immediately from (x^3 + y^3)/(x + y) = x^2 - x*y + y^2.

The Fibonacci identity follows immediately from (x^3 - y^3)/(x - y) = x^2 + x*y + y^2.

Clearly the same identities hold for the generalizations of Fibonacci and Lucas numbers for any quadratic u^2 - k*u - 1, k <> 0 an integer.