<?xml version="1.0" encoding="UTF-8"?>
<records>
<record>
<language>eng</language>
<publisher>Science and Education Publishing</publisher>
<journalTitle>Turkish Journal of Analysis and Number Theory</journalTitle>
<eissn>2333-1232</eissn>
<publicationDate>2018-04-09</publicationDate>
<volume>6</volume>
<issue>2</issue>
<startPage>49</startPage>
<endPage>51</endPage>
<doi>10.12691/tjant-6-2-3</doi>
<publisherRecordId>TJANT2018623</publisherRecordId>
<documentType>article</documentType>
<title language="eng">A Shortened Recurrence Relation for Bernoulli Numbers</title>
<authors>
<author>
<name>F. M. S. Lima</name>
<email>fabio@fis.unb.br</email>
<affiliationId>1</affiliationId>
</author>
</authors>
<affiliationsList>
<affiliationName affiliationId="1">Institute of Physics, University of Brasília, P.O. Box 04455, 70919-970, Brasília-DF, Brazil</affiliationName>

</affiliationsList>
<abstract language="eng">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.</abstract>
<fullTextUrl format="pdf">http://pubs.sciepub.com/tjant/6/2/3/tjant-6-2-3.pdf</fullTextUrl>
<keywords language="eng"><keyword>Bernoulli numbers</keyword>
<keyword>recurrence relations</keyword>
<keyword>Riemann zeta function</keyword>
</keywords>
</record>
</records>
