An efficient algorithm for the computation of Bernoulli numbers

Greg Fee, Simon Plouffe

This article gives a direct formula for the computation of B(n) using the asymptotic formula $$B(n)\approx 2\frac{n!}{{\pi }^n{2}^n}$$ where n is even and $n>>1$. This is si…