A Shortened Recurrence Relation for Bernoulli Numbers

In this note, starting with a little-known result of Kuo, I derive a recurrence relation for the Bernoulli numbers B2n , n being a positive integer. This formula is shown to be advantageous in comparison to other known formulae for the exact symbolic computation of B2n. Interestingly, it is suitable for large values of n since it allows the computation of both B4n and B4n+2 from only B0, B2, ..., B2n.