Recursion Formulas for Bernoulli Numbers

Aeran Kim


In this paper we establish simple recursion formulas forBernoulli numbers, for instance,\begin{align*} \sum_{k=1}^{n}\binom{4n+2}{4k}(-1)^k 2^{2k-1}B_{4k} = n\end{align*}and\begin{align*} \sum_{k=0}^{n}\binom{4n+4}{4k+2}(-1)^k 2^{2k}B_{4k+2} = n+1\end{align*}in Theorem 1.1. Furthermore applying a Lucas sequence $V_n$,we obtain\begin{align*} \sum_{k=1}^{n}\binom{8n+4}{8k}(-1)^k 2^{2k-1}B_{8k}V_{4n-4k+2} = nV_{4n+2}\end{align*}and\begin{align*} \sum_{k=0}^{n}\binom{8n+8}{8k+4}(-1)^k 2^{2k}B_{8k+4}V_{4n-4k+2} = -(n+1)V_{4n+3}\end{align*}in Theorem 1.2.

Full Text: PDF


  • There are currently no refbacks.

The Thai Journal of Mathematics is supported by The Mathematical Association of Thailand and Thailand Research Council and the Center for Promotion of Mathematical Research of Thailand (CEPMART).

Copyright 2022 by the Mathematical Association of Thailand.

All rights reserve. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, without the prior permission of the Mathematical Association of Thailand.

|ISSN 1686-0209|